#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define x first
#define y second
const int N=510,mod=998244353;

int gcd(int a,int b){return b?gcd(b,a%b):a;}
typedef pair<int,int> PII;

vector <vector<int> > g; 

ll solve(ll a,ll b) {
	for (ll x = b;x >= 1;--x) {//sqrt?
		if (a - x*x >= b-x && a >= x * x) {
			return x;
		}
	}
}

void work(int n,int m) {
	g.clear();
	g.resize(n+1);
	for (int i = 1;i <= n;++i) {
		g[i].resize(m+1);
	}
	
	ll now1 = n,now2 = n * (n-1) / 2;
	vector <int> qwq;
	
	while(1) {
		if (now2 == now1) {
			for (int i = 1;i <= now1;++i) qwq.push_back(1);
			break;
		}
		ll li = solve(now2,now1);
		//cout << li << " " << now2 << " " << now1 << "\n";
		qwq.push_back(li);
		now2 -= li * li;now1 -= li;	
	}
	//for (auto x : qwq) cout << x << " ";
	//cout <<" debug\n";
	int lst = 1,num = 0;
	for (auto x : qwq) {
		for (int i = lst;i <= lst + x - 1;++i) {
			for (int j = 1;j <= m;++j) {
				g[i][j] = num;
			}
		}
		lst = lst + x;num ^= 1;
	}
}

void slove(){
	int n,m;cin >> n >> m;
	ll ansnow = (n*(n+1)*m*(m+1)) / 4;
	if (ansnow & 1) {
		cout << "No" <<"\n";
		return ;
	} 
	ll tmp1 = n * (n+1) / 2,tmp2 = m * (m+1) / 2;
	int typ = 0;
	if (tmp1 % 2 == 0) work(n,m),typ = 1;
	else work(m,n);
	cout << "Yes\n";
	if (typ) {
		for (int i = 1;i <= n;++i) {
			for (int j = 1;j <= m;++j) {
				cout << g[i][j] <<  " ";
			}
			cout << "\n";
		}
	} else {
		for (int i = 1;i <= n;++i) {
			for (int j = 1;j <= m;++j) {
				cout << g[j][i] << " ";
			}
			cout << "\n";
		}
	}
}

signed main(){
	ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
	int T;cin >> T;
	while(T--) slove();
}