#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef pair<int,int> P;
typedef long double ld;

template<typename T>
istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template <typename T>
ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}

void solve(){
	int d, k;
	cin >> d >> k;
	if(d == 0){
		if(k == 1) cout << "Yes\n0 0\n";
		else cout << "No\n";
		return;
	}
	if(k > 4 * d){
		cout << "No\n";
		return;
	}
	vector<tuple<int, int, int>> a;
	rep(x, d){
		int y = d - x;
		a.emplace_back(x * x + y * y, x, y);
	}
	for(int y = 0; y > -d; y--){
		int x = d + y;
		a.emplace_back(x * x + y * y, x, y);
	}
	for(int x = 0; x > -d; x--){
		int y = -d - x;
		a.emplace_back(x * x + y * y, x, y);
	}
	rep(y, d){
		int x = -d + y;
		a.emplace_back(x * x + y * y, x, y);
	}
	sort(a.begin(), a.end());
	/*
	for(auto [tmp, x, y] : a){
		cout << x << ' ' << y << "\n";
	}
	*/
	auto [tmp, x, y] = a[k - 1];
	cout << "Yes\n";
	cout << x << ' ' << y << "\n";
}

int main(){
	int t;
	cin >> t;
	rep(_, t) solve();
	return 0;
}