#include<bits/stdc++.h>
using namespace std;
inline long long read()
{
	long long s=0,k=1;
	char c=getchar();
	while(!isdigit(c))
	{
		k=(c=='-')?-1:1;
		c=getchar();
	}
	while(isdigit(c))
	{
		s=s*10+c-'0';
		c=getchar();
	}
	return s*k;
}
#define d read()
#define ll long long
#define Maxn 10010
#define Size 10010
#define mp make_pair
#define pb push_back
#define fi first
#define se second
vector<ll>ans;
string s;
int main()
{
	ll t=d;
	while(t--)
	{
		ll n=d,m=d;
		if(n*(n+1)/2%2==1&&m*(m+1)/2%2==1)
		{
			puts("No");
			continue;
		}
		bool T;
		if(n*(n+1)/2%2==1) swap(n,m),T=1;
		ll cnt=n*(n+1)/4,sum=n;
		ans.clear();
		for(ll tag=n;tag&&sum&&cnt;tag--)
		{
			while(tag*(tag+1)/2<=cnt&&tag<=sum)
			{
				cnt-=tag*(tag+1)/2;
				sum-=tag;
				ans.pb(tag);
			}
			if(cnt==sum)
			{
				for(int i=0;i<cnt;i++) ans.pb(1);
				break;
			}
		}
		s="";
		char ch='0';
		for(int i=0;i<ans.size();i++,ch='0'+'1'-ch)
			for(int j=0;j<ans[i];j++)
				s+=ch;
		puts("Yes");
		if(T)
		{
			for(int i=0;i<m;i++,putchar('\n'))
				for(int j=0;j<n;j++)
					printf("%c ",s[j]);
		}
		else
		{
			for(int i=0;i<n;i++,putchar('\n'))
				for(int j=0;j<m;j++)
					printf("%c ",s[i]);
		}
	}
}