#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
#define ll long long
#define ull unsigned long long
#define mp make_pair
#define pb push_back
#define se second
#define fi first
#define ret(i,a,b) for(int i = (a);i<=(b);++i)
const int N=1e5+5;
const int M=1e6+5;
const ll inf=1e18;
const ll mod=998244353;
ll ksm(ll a,ll b)
{
	ll ret=1;
	while(b)
	{
		if(b&1) ret=ret*a%mod;
		a=a*a%mod;
		b>>=1;
	}
	return ret;
}
inline int read()
{
    int x=0,f=1;
    char ch=getchar();
    while(ch<'0'||ch>'9')
	{
        if(ch=='-')
            f=-1;
        ch=getchar();
    }
    while(ch>='0'&&ch<='9')
	{
        x=(x<<1)+(x<<3)+(ch^48);
        ch=getchar();
    }
    return x*f;
}
ll n,m,k;
ll p[M],ans[M];
void work()
{
	ll tot=m;
	ll anss=(m*m-m)/2;
	while(tot)
	{
		ll t=sqrt(anss);
		while(tot-t>anss-t*t) t--;
		anss-=t*t;
		tot-=t;
		ans[++k]=t;
		if(tot==anss)
		{
			ret(i,1,tot)
			{
				ans[++k]=1;
			}
			break;
		}
	}
	return ;
}
void solve()
{
	cin>>n>>m;
	k=0;
	if((n*(n+1)/2)%2==1&&(m*(m+1)/2)%2==1)
	{
		cout<<"No\n";
		return ;
	}
	bool swaped=0;
	if(n*(n+1)%4==0)
	{
		swap(n,m);
		swaped=1;
	}
	work();
	cout<<"Yes\n";
	if(!swaped)
	{
		vector<vector<int>> y(n+1,vector<int>(m+1));
		int w=0;
		int tot=0;
		ret(i,1,k)
		{
			ret(j,1,ans[i])
			{
				++tot;
				ret(x,1,n)
				{
					y[x][tot]=w;
				}
			}
			w=1-w;
		}
		ret(i,1,n)
		{
			ret(j,1,m)
			  cout<<y[i][j]<<" ";
			cout<<endl;
		}
	}
	else
	{
		vector<vector<int>> y(m+1,vector<int>(n+1));
		int w=0;
		int tot=0;
		ret(i,1,k)
		{
			ret(j,1,ans[i])
			{
				++tot;
				ret(x,1,n)
				{
					y[tot][x]=w;
				}
			}
			w=1-w;
		}
		ret(i,1,m)
		{
			ret(j,1,n)
			  cout<<y[i][j]<<" ";
			cout<<endl;
		}
	}
	return ;
}
int main()
{
	ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
	int _=1;
	cin>>_;
	while(_--) solve();
	return 0;
}