#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll=long long;

int main()
{
    int q;
    cin>>q;
    for(int i=0;i<q;i++){
        int d,k;
        cin>>d>>k;
        vector<pair<int,int>> p;
        for(int j=0;j<=d;j++){
            p.push_back({j,d-j});
            if(j!=0)p.push_back({-j,d-j});
            if(j!=d)p.push_back({j,j-d});
            if(j!=0&&j!=d)p.push_back({-j,j-d});
        }
        sort(p.begin(),p.end(),[](pair<int,int> a,pair<int,int> b){
            int xa=a.first,ya=a.second,xb=b.first,yb=b.second;
            return xa*xa+ya*ya<xb*xb+yb*yb;

        });
        if(p.size()<k)cout<<"No"<<endl;
        else {
            cout<<"Yes"<<endl;
            cout<<p[k-1].first<<" "<<p[k-1].second<<endl;
        }
    }
}