#include<iostream>
#include<vector>
#include<algorithm>
#include<cassert>
using namespace std;
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int Q;cin>>Q;
	for(;Q--;)
	{
		int D,K;
		cin>>D>>K;
		vector<pair<int,int> >X;
		for(int x=0;x<=D;x++)
		{
			int y=D-x;
			X.push_back(make_pair(x,y));
			X.push_back(make_pair(x,-y));
			X.push_back(make_pair(-x,y));
			X.push_back(make_pair(-x,-y));
		}
		sort(X.begin(),X.end());
		X.erase(unique(X.begin(),X.end()),X.end());
		vector<pair<int,pair<int,int> > >A(X.size());
		for(int i=0;i<X.size();i++)
		{
			A[i].second=X[i];
			A[i].first=X[i].first*X[i].first+X[i].second*X[i].second;
		}
		sort(A.begin(),A.end());
		if(A.size()<K)cout<<"No\n";
		else
		{
			cout<<"Yes\n";
			cout<<A[K-1].second.first<<" "<<A[K-1].second.second<<"\n";
		}
	}
}