#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)
#define rrep(i, n, a) for (int i = (int)(n); i >= (int)(a); i--)

void solve(){
    int d,k; cin >> d >> k;
    vector<pair<int, pair<int,int>>> dist;
    rep(i,1,d){ 
        int x = i;
        int y = d-i;
        dist.push_back(make_pair(x*x+y*y, make_pair(x,y)));
        dist.push_back(make_pair(x*x+y*y, make_pair(-x,y)));
        dist.push_back(make_pair(x*x+y*y, make_pair(x,-y)));
        dist.push_back(make_pair(x*x+y*y, make_pair(-x,-y)));
    }
    if(d == 0){
        dist.push_back(make_pair(0, make_pair(0,0)));
    } else {
        dist.push_back(make_pair(d*d, make_pair(0,d)));
        dist.push_back(make_pair(d*d, make_pair(d,0)));
        dist.push_back(make_pair(d*d, make_pair(0,-d)));
        dist.push_back(make_pair(d*d, make_pair(-d,0)));
    }
    sort(dist.begin(), dist.end());
    if(dist.size() < k){
        cout << "No";
    } else{
        cout << "Yes\n" << dist[k-1].second.first << " " << dist[k-1].second.second;
    }
    cout << endl;

}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t;
    cin >> t;
    rep(i,0,t) solve();

    return 0;
}