#include<bits/stdc++.h>
#define rep(i,a,b) for (register int i=(a);i<=(b);i++)
#define drep(i,a,b) for (register int i=(a);i>=(b);i--)
typedef long long ll;
using namespace std;

vector<int> split(int x)
{
	ll v=1ll*x*(x+1)/2/2-x;
	vector<int> ans;
	int s=0;
	drep(i,x,2)
	{
		ll nv=1ll*(i-1)*i/2;
		while (v>=nv)
		{
			v-=nv;
			s+=i;
			ans.push_back(i);
		}
	}
	assert(s<=x);
	rep(i,s+1,x) ans.push_back(1);
	
	ll vv=0;
	for (auto x:ans) vv+=1ll*x*(x+1)/2;
	assert(vv==1ll*x*(x+1)/2/2);
	return ans;
}

int a[10000000];
void solve()
{
	int n,m; cin>>n>>m;
	auto id=[&](int x,int y)
	{
		return (x-1)*m+y;
	};
	
	if ((n%4==0)||(n%4==3))
	{
		auto vec=split(n);
		int cur=0,st=1;
		for (auto x:vec)
		{
			rep(i,st,st+x-1) rep(j,1,m) a[id(i,j)]=cur;
			st+=x;
			cur^=1;
		} 
		printf("Yes\n");
		rep(i,1,n)
		{
			rep(j,1,m) printf("%d ",a[id(i,j)]);
			printf("\n");
		}
	}
	else if ((m%4==0)||(m%4==3))
	{
		auto vec=split(m);
		int cur=0,st=1;
		for (auto x:vec)
		{
			rep(i,st,st+x-1) rep(j,1,n) a[id(j,i)]=cur;
			st+=x;
			cur^=1;
		} 
		 
		printf("Yes\n");
		rep(i,1,n)
		{
			rep(j,1,m) printf("%d ",a[id(i,j)]);
			printf("\n");
		}
	}
	else
	{
		printf("No\n");
	}
}

int main()
{
	ios::sync_with_stdio(false); cin.tie(0);
	
	int T; cin>>T;
	while (T--) solve();
	
	return 0;
}