#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
using ll=long long;
using pii=pair<int,int>;
using vi=vector<int>;
using vl=vector<ll>;
#define pb push_back
#define all(a) begin(a),end(a)

const int N=310,MOD=1e9+7;
const char en='\n';
const ll LLINF=1ll<<60;

int t,n,r,mat[N][N];

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin>>t;
	while (t--)
	{
		cin>>n>>r;
		if (n==1)
		{
			cout<<"Yes\n";
			cout<<1<<en;
			continue;
		}
		if (n==2)
		{
			if (r==4)
			{
				cout<<"Yes\n";
				for (int i=0;i<n;++i,cout<<en) for (int j=0;j<n;++j) cout<<i*n+j+1<<' ';
			}
			else cout<<"No\n";
			continue;
		}
		if (n==3)
		{
			if (r==0)
			{
				cout<<"Yes\n";
				for (int i=0;i<n;++i,cout<<en) for (int j=0;j<n;++j) cout<<i*n+j+1<<' ';
			}
			else cout<<"No\n";
			continue;
		}
		int p=n*n+1;
		bool pri=1;
		for (int i=2;i<p;++i) if (p%i==0) pri=0;
		if (!pri)
		{
			cout<<"No\n";
			continue;
		}
		int pr=-1;
		for (int can=1;can<p;++can)
		{
			bool ok=1;
			int cu=can;
			for (int i=0;i<p-2;++i)
			{
				if (cu==1)
				{
					ok=0;
					break;
				}
				cu=(cu*can)%p;
			}
			if (ok)
			{
				pr=can;
				break;
			}
		}
		vi pots,ind(n*n+1);
		pots.pb(1);
		for (int i=0;i<p-2;++i) pots.pb((pots.back()*pr)%p);
		for (int i=0;i<p-1;++i) ind[pots[i]]=i;
		if (ind[r]%4!=2)
		{
			cout<<"No\n";
			continue;
		}
		int poo=n*n/4;
		for (int i=0;i<n/2;++i) for (int j=0;j<n/2;++j)
		{
			mat[i*2][j*2]=i*(n/2)+j;
			mat[i*2+1][j*2+1]=poo+i*(n/2)+j;
			mat[i*2][j*2+1]=poo*3-(i*(n/2)+j)-1;
			mat[i*2+1][j*2]=poo*4-(i*(n/2)+j)-1;
		}
		int s=(mat[0][0]+mat[0][1]+mat[1][0]+mat[1][1])%(n*n);
		int kol=(ind[r]-s)%(n*n);
		kol=(kol+n*n)%(n*n);
		kol/=4;
		for (int i=0;i<n;++i) for (int j=0;j<n;++j) mat[i][j]=(mat[i][j]+kol)%(n*n);
		for (int i=0;i<n-1;++i) for (int j=0;j<n-1;++j) assert((mat[i][j]+mat[i+1][j]+mat[i][j+1]+mat[i+1][j+1])%(n*n)==ind[r]);
		cout<<"Yes\n";
		for (int i=0;i<n;++i,cout<<en) for (int j=0;j<n;++j) cout<<pots[mat[i][j]]<<' ';
	}
}