#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint998244353;
//const int mod = 998244353;
//using mint = modint1000000007;
//const int mod = 1000000007;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int q; cin >> q;
	while (q--) {
		int d, k; cin >> d >> k;
		vector<pair<int, P>>v;
		rep2(i, -d, d + 1) {
			int j = d - abs(i);
			v.push_back({ i * i + j * j ,{i,j} });
			v.push_back({ i * i + j * j ,{i,-j} });
		}
		std::sort(v.begin(), v.end());
		v.erase(unique(v.begin(), v.end()), v.end());
		vector<int>v2;
		rep(i, v.size())v2.push_back(v[i].first);
		bool chk = false;
		int x = -1, y = -1;
		rep(i, v.size()) {
			// 以下
			int c1 = upper_bound(all(v2), v[i].first) - v2.begin();
			// 未満
			int c0 = lower_bound(all(v2), v[i].first) - v2.begin();
			if (c1 >= k && c0 < k) {
				chk = true;
				x = v[i].second.first;
				y = v[i].second.second;
			}
		}
		if (chk) {
			cout << "Yes" << endl;
			cout << x << " " << y << endl;
		}
		else {
			cout << "No" << endl;
		}
	}
	return 0;
}