Nastia has 2 positive integers An and B. She characterizes that: The integer is acceptable in case it is detachable by A⋅B; In any case, the integer is almost acceptable, in case it is detachable by A.
Correct answer only. Code and output screenshot.
Nastia has 2 positive integers An and B. She characterizes that:
The integer is acceptable in case it is detachable by A⋅B;
In any case, the integer is almost acceptable, in case it is detachable by A.
For instance, if A=6 and B=4, the integers 24 and 72 are acceptable, the integers 6, 660 and 12 are almost acceptable, the integers 16, 7 are neither acceptable nor almost great.
Discover 3 unique positive integers x, y, and z to such an extent that precisely one of them is acceptable and the other 2 are almost acceptable, and x+y=z.
Input
The main line contains a solitary integer t (1≤t≤10000) — the number of experiments.
The primary line of each experiment contains two integers An and B (1≤A≤106, 1≤B≤106) — numbers that Nastia has.
Output
For each experiment print:
"Indeed" and 3 distinct positive integers x, y, and z (1≤x,y,z≤1018) to such an extent that precisely one of them is acceptable and the other 2 are almost acceptable, and x+y=z.
"NO" if no answer exists.
You can print each character of "YES" or "NO" regardless.
Step by step
Solved in 3 steps with 1 images
