// g++-13 4.cpp -std=c++17 -O2 -I .
#include <bits/stdc++.h>
using namespace std;

#include <atcoder/all>
using namespace atcoder;

using ll = long long;
using ld = long double;
 
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vst = vector<string>;
using vvst = vector<vst>;
 
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define pq_big(T) priority_queue<T,vector<T>,less<T>>
#define pq_small(T) priority_queue<T,vector<T>,greater<T>>
#define all(a) a.begin(),a.end()
#define rep(i,start,end) for(ll i=start;i<(ll)(end);i++)
#define per(i,start,end) for(ll i=start;i>=(ll)(end);i--)
#define uniq(a) sort(all(a));a.erase(unique(all(a)),a.end())

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int q;cin>>q;
  while(q--){
    int d,k;cin>>d>>k;
    if(d==0){
      if(k==1){
        cout<<"Yes"<<endl;
        cout<<"0 0"<<endl;
        continue;
      }
      else{
        cout<<"No"<<endl;
        continue;
      }
    }
    if(4*d<k){
      cout<<"No"<<endl;
      continue;
    }
    vector<tuple<ll,int,int>> v;
    rep(x,0,d+1){
      int y=d-x;
      int ds=x*x+y*y;
      v.emplace_back(ds,x,y);
      if(x!=0&&y!=0)v.emplace_back(ds,-x,-y);
      if(x!=0)v.emplace_back(ds,-x,y);
      if(y!=0)v.emplace_back(ds,x,-y);
    }
    sort(all(v));

    cout<<"Yes"<<endl;
    auto [ds,x,y]=v[k-1];
    cout<<x<<" "<<y<<endl;
  }
}