MyCode

ll lcm(ll a , ll b){
    return a / __gcd(a,b) * b ;
}
ll n , m ;
ll div(ll c)
{
   if(((c-n)%m==0)||((c-n)%n==0))
   return (c-n);
   if(((c-m)%n==0)||((c-m)%m==0))
   return (c-m);


}
void solve()
{


     cin >> n >> m ;

    if(lcm(n,m)==2*n)
 cout<<"YES\n"<<m<<" "<<(lcm(n,m)-m)<<" "<<lcm(n,m);
 else
  cout<<"YES\n"<<n<<" "<<div(lcm(n,m))<<" "<<lcm(n,m);
  }

int main()
{
   ShrOOk();
   int t=1;
   cin>>t;
   while(t--)
   {

       solve();
      cout<<nl;
   }


    return 0;
}