Divisibility

1000ms

262144K

Description:

Imp is really pleased that you helped him. But it you solve the last problem, his gladness would raise even more.

$\text{[math]}$ Let's define $\text{[math]}$ for some set of integers $\text{[math]}$ as the number of pairs a, b in $\text{[math]}$ , such that:

a is strictly less than b;
a divides b without a remainder.

You are to find such a set $\text{[math]}$ , which is a subset of {1, 2, ..., n} (the set that contains all positive integers not greater than n), that $\text{[math]}$ .

Input:

The only line contains two integers n and k $\text{[math]}$ .

Output:

If there is no answer, print "No".

Otherwise, in the first line print "Yes", in the second — an integer m that denotes the size of the set $\text{[math]}$ you have found, in the second line print m integers — the elements of the set $\text{[math]}$ , in any order.