#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
 
#include<bits/stdc++.h>
using namespace std;
 
int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  int q;
  cin>>q;
  while(q--){
    ll d,k;
    cin>>d>>k;
    
    if(d==0 && k==1){
      cout<<"Yes"<<endl;
      cout<<0<<" "<<0<<endl;
      continue;
    }
    if(d==0){
      cout<<"No"<<endl;
      continue;
    }
    
    vector<pair<ll,pair<ll,ll>>> P;
    for(ll i=1;i<=d;i++){
      ll dis=i*i+(d-i)*(d-i);
      P.push_back({dis,{i,d-i}});
      P.push_back({dis,{-i,-d+i}});
      P.push_back({dis,{-i,d-i}});
      P.push_back({dis,{i,-d+i}});
    }
    if((int)P.size()<k){
      cout<<"No"<<endl;
      continue;
    }
    cout<<"Yes"<<endl;
    sort(ALL(P));
    cout<<P[k-1].second.first<<" "<<P[k-1].second.second<<endl;
  }
    
  return 0;
}