B'Some time ago Homer lived in a beautiful city. There were n blocks numbered from 1 to n and m directed roads between them. Each road had a positive length, and each road went from the block with the smaller index to the block with the larger index. For every two (different) blocks, there was at most one road between them. Homer discovered that for some two numbers L and R the city was (L, R) -continuous. The city is said to be (L, R) -continuous, if A path from block u to block v is a sequence u = x_0 to x_1 to x_2 to ... to x_k = v , where there is a road from block x_{i-1} to block x_{i} for every 1 <= q i <= q k . The length of a path is the sum of lengths over all roads in the path. Two paths x_0 to x_1 to ... to x_k and y_0 to y_1 to ... to y_l are different, if k neq l or x_i neq y_i for some 0 <= q i <= q min {k, l } . After moving to another city, Homer only remembers the two special numbers L and R but forgets the numbers n and m of blocks and roads, respectively, and how blocks are connected by roads. However, he believes the number of blocks should be no larger than 32 (because the city was small). As the best friend of Homer, please tell him whether it is possible to find a (L, R) -continuous city or not. The single line contains two integers L and R ( 1 <= q L <= q R <= q 10^6 ). If it is impossible to find a (L, R) -continuous city within 32 blocks, print "NO" in a single line. Otherwise, print "YES" in the first line followed by a description of a (L, R) -continuous city. The second line should contain two integers n ( 2 <= q n <= q 32 ) and m ( 1 <= q m <= q frac {n(n-1)} 2 ), where n denotes the number of blocks and m denotes the number of roads. Then m lines follow. The i -th of the m lines s'...