Today, Sakurako was playing with her dog. Its name is Martel, and since he is very smart, he plays only in math games. Martel chose two numbers and and gave them to Sakurako.
In one turn, she can change to one of the following numbers:
n:=\lfloor\sqrt{n}\rfloor.
n:=\lceil\sqrt{n}\rceil.
Martel asks if she can get from , by using either one of these operations any number of times and if yes, what is the sequence of operations. Since Martel comes up with numbers really fast, Sakurako doesn't have enough time to solve the task, so she asks you for help.
is the biggest integer that is at most . For example, \lfloor 4.3\rfloor = 4; is also 4.
is the smallest integer that is at least . For example, \lceil 4.3\rceil = 5; is also 5.
The first line contains two integers and (1\le x\le n\le 10^{18}) — two numbers that Martel chose.
Note that it is recommended to use 64-bit integers (for example, long long in C++).
In the first line, output "Yes" if it is possible to get from to by some number of operations and "No" otherwise.
If it is possible to do so, in the next line output a single integer (0\le k \le 500) — the number of operations you need to get . Note, there is no need to minimize .
In the third line, output characters or where means to use operation \lfloor\sqrt{n}\rfloor and means to use \lceil\sqrt{n}\rceil operation.
Notice that there may be many possible answers; you are allowed to output an arbitrary one that meets the conditions described in the statement.
Example 1
Example 2
In the first test, we can use the following list of operations 9\to \lfloor{\sqrt{9}}\rfloor=3 \to \lceil{\sqrt{3}}\rceil=2.
We can show that there is no way of getting from in the second example.
In this task, each test is scored individually.
In order to get full points, you are supposed to give out the exact way of getting from to .
To get of points if the answer is "Yes", you need either output k=-1 and nothing after this, or output and any operations.