#include <iostream>
#include <vector>
#include <unordered_map>
#include <queue>
#include <climits>
#include <algorithm>
#include <stack>
#include <math.h>
#include <set>
#include <map>
typedef long long ll;
typedef long double ld;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define INF INT_MAX
#define fi first
#define sec second
#define pii pair<ll,ll> 
#define vi vector< ll > 
#define vvi vector< vi > 
#define vpi vector< pii > 
#define vvpi vector< vpi > 
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define test(t) ll t;cin>>t;while(t--){solve();}
#define mem(a,b) memset(a,b,sizeof(a))
#define inn freopen("input.txt", "r", stdin)
#define outt freopen("output.txt", "w", stdout)
#define all(arr) arr.begin(),arr.end()
#define fr(i,n) for(ll i=0;i<(n);++i)
#define rep(i,a,b) for(ll i=a;i<=b;++i)
#define per(i,a,b) for(ll i=a;i>=b;i--)
#define remin(a,b) (a=min((a),(b)))
#define remax(a,b) (a=max((a),(b)))
#define pq_max priority_queue<ll>
#define pq_min priority_queue<ll,vector<ll>,greater<ll>>
#define dbgarr(arr) for(ll i=0;i<arr.size();i++){cout<<arr[i];}
#define dbg(val) cout<<val<<endl;
#define PI 3.141592653589793238
using namespace std;

void solve()
{
 //code
ll a,b;
cin>>a>>b;
if(b==1){
	cout<<"NO\n";
	return;
}
cout<<"YES\n";
ll x=a;
ll y=a*b;
ll z=(a*b)+a;
cout<<x<<" "<<y<<" "<<z<<endl;

}
 
int main() {
	// your code goes here
      #ifndef ONLINE_JUDGE
		inn;
		outt;
		#endif
	fast;
     test(t)
    //solve();
	return 0;
}