#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;

vector<int> getres(int n)
{
	ll need = (ll)n * (n+1) / 4 - n;
	int rem = n;
	vector<int> res;
	int k = 0;
	for(ll i=n; i>=1; --i)
	{
		ll cur = (ll)i * (i+1) / 2 - i;
		while(cur <= need && i <= rem)
		{
			need -= cur; rem -= i;
			res.insert(res.end(), i, k);
			k ^= 1;
		}
	}
	return res;
}

void solve(void)
{
	int n,m;
	scanf("%d%d",&n,&m);
	
	if((ll)n * (n+1) % 4 == 0)
	{
		printf("Yes\n");
		auto res = getres(n);
		for(int i=0; i<n; ++i, printf("\n"))
			for(int j=0; j<m; ++j)
				printf("%d ",res[i]);
	}
	else if((ll)m * (m+1) % 4 == 0)
	{
		printf("Yes\n");
		auto res = getres(m);
		for(int i=0; i<n; ++i, printf("\n"))
			for(int j=0; j<m; ++j)
				printf("%d ",res[j]);
	}
	else
	{
		printf("No\n");
	}
}

int main(void)
{
	int T;
	scanf("%d",&T);
	while(T--) solve();
	return 0;
}