// #pragma GCC target("avx")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i = (int)a; i < (int)b; i++)
#define all(x) x.begin(),x.end()
//#define mp make_pair
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vvvvi vector<vvvi>
#define pii pair<int,int>
#define vpii vector<pair<int,int>>

template<typename T>
bool chmax(T &a, const T b) {if(a<b) {a=b; return true;} else {return false;}}
template<typename T>
bool chmin(T &a, const T b) {if(a>b) {a=b; return true;} else {return false;}}

using ll = long long;
using ld = long double;
using ull = unsigned long long;

const ll INF = numeric_limits<long long>::max() / 2;
const ld pi = 3.1415926535897932384626433832795028;
const ll mod = 998244353;
int dx[] = {1, 0, -1, 0, -1, -1, 1, 1};
int dy[] = {0, 1, 0, -1, -1, 1, -1, 1};

#define int long long

void solve() {
    int q;
    cin >> q;
    while(q--) {
        int d, k;
        cin >> d >> k;
        vpii points;
        repi(x, -d, d+1) repi(y, -d, d+1) if(abs(x)+abs(y) == d) {
            points.emplace_back(x, y);
        }
        sort(all(points), [](pii x, pii y) -> bool {
            int dx = abs(x.first)*abs(x.first)+abs(x.second)*abs(x.second);
            int dy = abs(y.first)*abs(y.first)+abs(y.second)*abs(y.second);
            return dx<dy;
        });
        if((int)points.size() < k) cout << "No" << endl;
        else {
            cout << "Yes" << endl;
            cout << points[k-1].first << " " << points[k-1].second << endl;
        }
    }
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}