#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve()
{
	ll n,m;
	cin>>n>>m;
	ll tt=n*m*(n+1)*(m+1)/4;
	if(tt&1)
	{
		cout<<"No"<<endl;
		return;
	}
	auto get_ans=[&](ll x)->ll
	{
		ll l=1,r=1e6;
		while(l<r)
		{
			ll mid=(l+r+1)>>1;
			if(mid*mid<=x) l=mid;
			else r=mid-1;
		}
		return l;
	};
	vector<ll>len;
	vector<vector<int>>ans(n+1,vector<int>(m+1,0));
	if((n*(n+1)/2)%2==0)
	{
		ll sub=n*(n-1)/2;
		while(sub)
		{
			ll tt=get_ans(sub);
			len.push_back(tt);
			sub-=tt*tt;
		}
		int idx=1;
		bool flag=0;
		for(auto c:len)
		{
			for(int i=idx;i<=idx+c-1;i++)
				for(int j=1;j<=m;j++)
					ans[i][j]=flag;
			flag=!flag;
			idx+=c;
		}
	}
	else
	{
		ll sub=m*(m-1)/2;
		while(sub)
		{
			ll tt=get_ans(sub);
			len.push_back(tt);
			sub-=tt*tt;
		}
		int idx=1;
		bool flag=0;
		for(auto c:len)
		{
			for(int i=idx;i<=idx+c-1;i++)
				for(int j=1;j<=n;j++)
					ans[j][i]=flag;
			flag=!flag;
			idx+=c;
		}
	}
	cout<<"Yes"<<endl;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
			cout<<ans[i][j]<<' ';
		cout<<endl;
	}
}
int main()
{
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int t=1;
	cin>>t;
	while(t--)
		solve();
	return 0;
}