#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
typedef long double ld;
int dx[8] = { 1, 0, -1, 0, 1, 1, -1, -1 }, dy[8] = { 0, 1, 0, -1, 1, -1, 1, -1 };
const long long mod = 998244353;
const ll inf = 1LL << 60;
const int INF = 5e8;

void solve()
{
    int d, k;
    cin >> d >> k;
    vector<int> v;
    if (d == 0) {
        if (k == 1) {
            cout << "Yes" << endl;
            cout << 0 << ' ' << 0 << endl;
        } else {
            cout << "No" << endl;
        }
        return;
    }
    for (int x = 0; x < d; x++) {
        int l = 0, r = 0;
        for (int j = 0; j < d; j++) {
            if (x * x + (d - x) * (d - x) >= j * j + (d - j) * (d - j)) {
                r++;
                if (x * x + (d - x) * (d - x) > j * j + (d - j) * (d - j)) {
                    l++;
                }
            }
        }
        l *= 4;
        r *= 4;
        if (l < k and r >= k) {
            cout << "Yes" << endl;
            cout << x << ' ' << d - x << endl;
            return;
        }
    }
    cout << "No" << endl;
}

int main()
{
    int q;
    cin >> q;
    for (int i = 0; i < q; i++) {
        solve();
    }
}