/*
---> Test Cases (n = 1 to n = n)
---> division by zero 
---> overflow(array, integer)
---> optimization
*/
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

void Test()
{
    ll a, b;
    cin >> a >> b;
    if(b == 1){
        cout << "NO" << endl;
        return;
    }
    cout << "YES" << endl;
    if(b == 2){
        cout << a << " " << a * (b + 1) << " " << a + a * (b + 1) << endl;
    }
    else{
        cout << a << " " << a * (b - 1) << " " << a + a * (b - 1) << endl;
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int T;
    cin >> T;
    while(T--){
        Test();
    }    
}
