M. Multiply and Add
time limit per test
1 second
memory limit per test
1024 megabytes
input
standard input
output
standard output

You are given two non-negative integers $$$m$$$ and $$$n$$$.

Find any triple of non-negative integers $$$(a, b, c)$$$ such that:

  • $$$0 \leq a, b, c \leq m$$$;
  • $$$a \cdot b + c = n$$$.
Input

The first line contains a single integer $$$t$$$ ($$$1 \leq t \leq 10^4$$$): the number of test cases. Then, $$$t$$$ test cases follow.

The only line of a test case contains two integers $$$m$$$ and $$$n$$$ ($$$0 \leq m, n \leq 10^{18}$$$).

Output

For each test case, print YES in the first line if such a triple exists; otherwise, print NO. You may print the words in any case.

If a triple exists, print three required integers $$$a$$$, $$$b$$$, $$$c$$$ in the second line for that test case. If there are several valid answers, print any.

Example
Input
6
5 7
10 67
300 10000
1511 2026
20 9000
0 3
Output
YES
2 2 3
YES
7 9 4
YES
200 50 0
YES
1511 1 515
NO
NO
Note

In the first test case of the example, the triples $$$(1, 2, 5)$$$ and $$$(4, 1, 3)$$$ are also valid answers since $$$1 \cdot 2 + 5 = 4 \cdot 1 + 3 = 7 = n$$$. However, $$$(6, 1, 1)$$$ is not a valid answer because $$$a = 6 \gt 5 = m$$$.