#include<bits/stdc++.h>
using namespace std;
#define V vector
#define pb push_back
#define fi first
#define se second
typedef long long LL;
typedef pair<int, int> pi;

mt19937 mrand(chrono::steady_clock().now().time_since_epoch().count());

LL qpow(LL x, LL k, int mod) {
    LL ans = 1;
    while(k) {
        if(k & 1) ans = ans * x % mod;
        k = k / 2;
        x = x * x % mod;
    }
    return ans;
}

bool ok(int gen, int mod) {
    V<int> tab(mod, -1);
    int now = 1;
    for(int i = 1; i < mod; i++) {
        // cout << now << endl;
        if(tab[now] != -1) return 0;
        tab[now] = i;
        now = 1LL * now * gen % mod;
    }
    return 1;
}
map<int, int> nd;
LL get_root(int mod) {
    if(nd.count(mod)) return nd[mod];
    for(int i = 1; i < mod; i++) {
        if(ok(i, mod)) return nd[mod] = i;
    }
    assert(0);
}

void solve(){
    int n; cin >> n;
    int r; cin >> r;
    V<V<int>> base(n + 1, V<int>(n + 1));
    // cout << get_root(998244353) << endl;
    int mod = n * n + 1;
    if(r == 0) {
        cout << "No" << endl;
        return;
    }
    for(int i = 2; i < mod; i++) {
        if(mod % i == 0) {
            cout << "No" << endl;
            return; 
        }
    }

    LL gen = get_root(mod);
    // cout << "gen : " << gen << endl;

    V<int> tab(n * n + 1);
    V<int> invtab(n * n);
    int now = 1;
    for(int i = 0; i < n * n; i++) {
        // cout << now << endl;
        assert(tab[now] == 0);
        tab[now] = i;
        now = 1LL * now * gen % mod;
    }
    for(int i = 1; i <= n * n; i++) {
        assert(invtab[tab[i]] == 0);
        invtab[tab[i]] = i;
    }


    // -> ans for 2
    int k = 0;

    if(tab[r] % 4 != 2) {
        cout << "No" << endl;
        return;
    }

    auto get = [&](int x) -> int {
        return invtab[(x + (tab[r] - 2) / 4) % (n * n)];
    };

    for(int i = 1; i <= n; i += 2) {
        for(int j = 1; j <= n; j += 2) {
            k++;
            base[i][j] = get(k);
            base[i + 1][j] = get(n * n / 2 + 1 - k);
            base[i][j + 1] = get(n * n + 1 - k);
            base[i + 1][j + 1] = get(n * n / 2 + k);
        }
    }

    // for(int i = 1; i < n; i++) {
    //     for(int j = 1; j < n; j++) {
    //         assert(1LL * base[i][j] * )
    //     }
    // }
    cout << "Yes" << endl;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= n; j++) cout << base[i][j] << " ";
        cout << endl;
    }    

}
int main(){
    ios::sync_with_stdio(0),cin.tie(0);
    int t; cin >> t;
    while(t--)
    solve();
}