You are given two non-negative integers $$$m$$$ and $$$n$$$.
Find any triple of non-negative integers $$$(a, b, c)$$$ such that:
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}$$$).
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.
65 710 67300 100001511 202620 90000 3
YES2 2 3YES7 9 4YES200 50 0YES1511 1 515NONO
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$$$.
| Name |
|---|


