#include <bits/stdc++.h>
using namespace std;
#define rep(i, x, limit) for (long long i = (long long)x; i < (long long)limit; i++)
#define REP(i, x, limit) for (long long i = (long long)x; i <= (long long)limit; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define el '\n'
#define spa " "
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define YES cout << "YES" << el
#define NO cout << "NO" << el
#define eps (1e-10)
#define Equals(a,b) (fabs((a) - (b)) < eps )
#define debug(x) cerr << #x << " = " << x << el
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vs = vector<string>;
using vb = vector<bool>;
const double pi = 3.141592653589793238;
const int inf = 1073741823;
const ll infl = 1LL << 60;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvwxyz";
const ll MOD = 998244353;
#include<atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using vm = vector<mint>;

bool P(ll d,ll k){
    if(d==0){
        if(k==1){
            Yes;
            cout<<0<<spa<<0<<el;
            return true;
        }
        else{
            return false;
        }
    }
    map<ll,ll> mp;
    REP(i,1,d){
        mp[i*i+(d-i)*(d-i)]++;
    }
    ll cnt=0;
    for(auto [x,y]:mp){
        cnt+=y*4;
        if(cnt>=k){
            Yes;
            REP(i,i,d){
                if(i*i+(d-i)*(d-i)==x){
                    cout<<i<<spa<<d-i<<el;
                    return true;
                }
            }
            return true;
        }
    }
    return false;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll q;cin>>q;
  while(q--){
    ll d,k;cin>>d>>k;
    if(!P(d,k)) No;
  }
}