Nastia and Nearly Good Numbers

蒟蒻又签到失败了。想哭。

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≤10000) — the number of test cases.

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

Output
For each test case print:

“YES” and 3 different positive integers x, y, and z (1≤x,y,z≤1018) 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.

Example
inputCopy
3
5 3
13 2
7 11
outputCopy
YES
10 50 60
YES
169 39 208
YES
28 154 182
Note
In the first test case: 60 — good number; 10 and 50 — nearly good numbers.

In the second test case: 208 — good number; 169 and 39 — nearly good numbers.

In the third test case: 154 — good number; 28 and 182 — nearly good numbers.
这题的考点：

1，long long

我确实太垃圾了，连这个都要忘记。

2，b不可以为1

我在思考的时候判断不可以的条件是 a%b==0;
但是存在一个数是 nearly 就是 a，它不是good number
错误就在于我想到的是 good number它可以被a mod=0，就一定可以被他们的最新公倍数 mod但是题目是说的是被a*b mod

/#include <iostream>
#include "algorithm"
#include "vector"
#include "queue"
#include "cstdlib"
#include "cstdio"
#include "map"
#include "set"
#include "cstring"
#include "numeric"
#include "string"
using namespace std;
#define INF 0x3f3f3f3f
int gcd (int a,int b)
{
    int g ;
    if (b==0) g = a;
    else g = gcd(b,a%b);
    return g;
}
long long gbs(int a,int b)
{
    long long p = a*b;
    return p/gcd(a,b);
}
int main ()
{
    int T,x,y,z ;
    long long a,b;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%lld%lld",&a,&b);
        if(b==1)
        {
            printf("NO\n");
            continue;
        }
        printf("YES\n"); 
        printf("%lld %lld %lld\n",a*(b-1),a*(b+1),2*a*b);
    }
    return  0;
}