#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <cassert>
#define int long long
#define rep(i, n) for(i = 0; i < n; i++)
using namespace std;

signed main() {
	int q;
	cin >> q;
	while (q--) {
		int d, K;
		cin >> d >> K;
		K--;

		typedef tuple<int, int, int> T;
		vector<T> vec;
		for (int y = -d; y <= d; y++) {
			for (int x = -d; x <= d; x++) {
				if (abs(x) + abs(y) != d) continue;
				vec.push_back(T(x * x + y * y, x, y));
			}
		}
		sort(vec.begin(), vec.end());
		if (K >= vec.size()) { cout << "No" << endl; }
		else {
			cout << "Yes" << endl;
			cout << get<1>(vec[K]) << " " << get<2>(vec[K]) << endl;
		}
	}
	return 0;
}