Chefir is Lost#366

Chefir is Lost

Recently, Chefir got lost on a coordinate axis. Right now he is in position . In order to get to Sakurako, who's in position , he can repeat the following operations multiple times:

If your current position is , you may change it to:

  1. a=a-q, where is the minimum divisor of such that q>1.

  2. a=a-w, where is the maximum divisor of such that w<a.

Your task is not only to determine whether there is a sequence of operations which will help Chefir get from position to position , but also to output it.

Input

The first line contains two integers and (2\le x < n\le 10^{12}).

Output

If it is possible to do so, print "YES"; otherwise, print "NO".

If it is possible to do so, in the next line output a single integer (0 \le k\le 500) — the amount of shorten operations that you are planning to do. There is no need to minimize .

Each of the next lines should contain two integers (op\in\{1,2\} and 1 \leq y \leq 10^{12}) — the type of operation that you are making and the amount of times that you will be repeating this operation.

Examples

Example 1

Loading
Loading

Example 2

Loading
Loading

Example 3

Loading
Loading

Note

In the first example, the optimal solution is:

  1. first subtract as the smallest divisor of , making n=18;

  2. subtract from 18 as the biggest divisor of that is not equal to .

Now n=9, which is equal to .

In the second example, changes in the following way:

25 \to 20 \to 18 \to 9.

We can prove that there is no way to get from to .

Scoring

In this task, each test is scored individually.

In this task, you can get partial points by only answering whether there is a way for Chefir to get from position to position .

In order to get full points, you are supposed to give out the exact way of getting from to .

If you correctly determine that there is a sequence, but you print out k=0 and no proof after that, you will get 50% of the points.