#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rrep1(i, n) for (int i = n; i >= 1; i--)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define eb emplace_back
#define fi first
#define se second
#define sz(x) (int)(x).size()
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
typedef long long int ll;
// typedef modint998244353 mint;

void speedUpIO() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
}

template <class T> bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <class T> bool chmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
/*--------------------------------------------------*/
typedef pair<int, int> P;
typedef pair<int, P> PP;

const int INF = 1e9;
const ll LINF = 1e18;
const int MAX = 1e5;

void solve() {
    int q;
    cin >> q;
    rep(qi, q) {
        int d, k;
        cin >> d >> k;
        V<PP> v;
        for (int x = -d; x <= d; x++) {
            for (int y = -d; y <= d; y++) {
                if (abs(x) + abs(y) != d) continue;
                v.eb(x * x + y * y, P(x, y));
            }
        }
        if (sz(v) < k) {
            cout << "No\n";
            continue;
        }
        cout << "Yes\n";
        sort(all(v));
        cout << v[k - 1].se.fi << " " << v[k - 1].se.se << "\n";
    }
}

int main() {
    speedUpIO();
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
        // cout << solve() << "\n";
        // cout << (solve() ? "Yes" : "No") << "\n";
        // cout << fixed << setprecision(15) << solve() << "\n";
    }
    return 0;
}