#include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
#define int long long
#define RI register int
#define CI const int&
using namespace std;
const int N=1e6+5;
int t,n,m,p[N],ans[N];
signed main()
{
	RI i,j; for (i=1;i<=1000000;++i) p[i]=i*(i+1)/2LL;
	for (scanf("%lld",&t);t;--t)
	{
		scanf("%lld%lld",&n,&m);
		if ((n*(n+1)/2LL)%2==1&&(m*(m+1)/2LL)%2==1) { puts("No"); continue; }
		bool swaped=0; if ((n*(n+1)/2LL)%2==1) swap(n,m),swaped=1;
		vector <int> vec; int tar=n*(n+1)/4LL,sum=0;
		while (tar>0)
		{
			int pos=upper_bound(p+1,p+1000000,tar)-p-1;
			while (sum+pos+tar-p[pos]<n) --pos;
			vec.push_back(pos); sum+=pos; tar-=p[pos];
		}
		//for (auto x:vec) printf("%lld ",x); putchar('\n');
		int c=0; i=0; puts("Yes");
		for (auto x:vec)
		{
			for (j=1;j<=x;++j) ans[++i]=c;
			c^=1;
		}
		if (swaped)
		{
			for (i=1;i<=m;++i)
			for (j=1;j<=n;++j) printf("%lld%c",ans[j]," \n"[j==n]);
		} else
		{
			for (i=1;i<=n;++i)
			for (j=1;j<=m;++j) printf("%lld%c",ans[i]," \n"[j==m]);
		}
	}
	return 0;
}