#include <bits/stdc++.h>
#define int long long
#define INF 0x3f3f3f3f
#define endl '\n'

using namespace std;

int n,m;

void solve()
{
	cin>>n>>m;
	if(n*m*(n+1)*(m+1)/4%2)
	{
		cout<<"No\n";
		return;
	}
	if(n*(n+1)/2%2==0)
	{
		int k=n*(n+1)/2,c=n;
		vector<int> ot,res;
		while(k-c)
		{
			int l=1,r=c,mid,ans=1;
			while(l<=r)
			{
				mid=(l+r)/2;
				if(k-mid*(mid+1)-c+mid>=0) l=mid+1,ans=max(ans,mid);
				else r=mid-1;
			}
			ot.push_back(ans);
			k-=ans*(ans+1);
			c-=ans;
		}
		for(int i=0;i<ot.size();i++)
			while(ot[i]--) res.push_back(i&1);
		
		cout<<"Yes\n";
		for(auto u:res)
		{
			for(int i=1;i<=m;i++) cout<<u<<" ";
			cout<<endl;
		}
	}
	else if(m*(m+1)/2%2==0)
	{
		int k=m*(m+1)/2,c=m;
		vector<int> ot,res;
		while(k-c)
		{
			int l=1,r=c,mid,ans=1;
			while(l<=r)
			{
				mid=(l+r)/2;
				if(k-mid*(mid+1)-c+mid>=0) l=mid+1,ans=max(ans,mid);
				else r=mid-1;
			}
			ot.push_back(ans);
			k-=ans*(ans+1);
			c-=ans;
		}
		for(int i=0;i<ot.size();i++)
			while(ot[i]--) res.push_back(i&1);
		
		cout<<"Yes\n";
		for(int i=1;i<=n;i++)
		{
			for(auto u:res) cout<<u<<" ";
			cout<<endl;
		}
	}
}
signed main()
{
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int T=1;
	cin>>T;
	while(T--) solve();
	return 0;
}