CodeForces 1521A 题目翻译+思路详解+样例程序

题目

原文描述：
Nastia has 2 positive integers A and B. She defines that:

• The integer is good if it is divisible by A⋅B；
• Otherwise, the integer is nearly good, if it is divisible by A.

For example, if A=6 and B=4, the integers 24 and 72 are good, the integers 6, 660 and 12 are nearly good, the integers 16, 7 are neither good nor nearly good.

Find 3 different positive integers x, y, and z such that exactly one of them is good and the other 2 are nearly good, and x+y=z.

Input：
The first line contains a single integer t (1≤t≤10 000) — the number of test cases.

The first line of each test case contains two integers A and B (1≤A≤10⁶, 1≤B≤10⁶) — numbers that Nastia has.

Output：
For each test case print:

• “YES” and 3 different positive integers x, y, and z (1≤x,y,z≤10¹⁸) such that exactly one of them is good and the other 2 are nearly good, and x+y=z.
• “NO” if no answer exists.

You can print each character of “YES” or “NO” in any case.
If there are multiple answers, print any.

input
3
5 3
13 2
7 11

output
YES 10 50 6