B'Imp is really pleased that you helped him. But it you solve the last problem, his gladness would raise even more. You are to find such a set , which is a subset of {1, xe2 x80 x892, xe2 x80 x89..., xe2 x80 x89n} (the set that contains all positive integers not greater than n), that . The only line contains two integers n and k . 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 you have found, in the second line print m integers -- the elements of the set , in any order. If there are multiple answers, print any of them. In the second sample, the valid pairs in the output set are (1, xe2 x80 x892), (1, xe2 x80 x894), (1, xe2 x80 x895), (1, xe2 x80 x896), (2, xe2 x80 x894), (2, xe2 x80 x896). Thus, . In the third example, the valid pairs in the output set are (2, xe2 x80 x894), (4, xe2 x80 x898), (2, xe2 x80 x898). Thus, . '...