CF241D Numbers

You have a sequence of $ n $ distinct integers $ a_{1},a_{2},...,a_{n} $ $ (1

The first line of the input contains two integers $ n $ and $ p $ $ (1

If there is no solution for the given input, print "No" (without quotes) in the only line of the output. Otherwise print "Yes" in the first line of output. The second line should contain an integer $ k $ $ (k>0) $ specifying the number of remaining elements and the third line should contain $ k $ distinct integers $ x_{1},x_{2},...,x_{k} $ $ (1