#include<bits/stdc++.h>
using namespace std;
template <typename T> inline void read(T &x)
{
	x=0;short f=1;char c=getchar();
	for(;c<'0'||c>'9';c=getchar()) if(c=='-') f=-1;
	for(;c>='0'&&c<='9';c=getchar()) x=(x<<1)+(x<<3)+(c^48);
	x*=f;return;
}
#define ll long long
int n,m;
int get(ll x,int up)
{
	int l=1,r=up,ans=l;
	while(l<=r)
	{
		int mid=l+r>>1;
		if(1ll*mid*(mid+1)/2<=x) l=mid+1,ans=mid;
		else r=mid-1;
	}
	return ans;
}
void solve()
{
	read(n),read(m);
	if(1ll*n*(n+1)/2%2==1&&1ll*m*(m+1)/2%2==1)
		return puts("No"),void();
	if(1ll*m*(m+1)/2%2==0)
	{
		vector<int>v;
		ll t=1ll*m*(m+1)/4-m;
		int len=m,cnt=0;
		while(t&&len)
		{
			int x=get(t,len);
			v.push_back(x);
			len-=x,t-=1ll*x*(x+1)/2;
		}
		while(cnt<m) v.push_back(1),++cnt;
		puts("Yes");
		for(int i=1;i<=n;++i)
		{
			int c=1;
			for(int x:v)
			{
				while(x--) putchar(c+'0'),putchar(' ');
				c^=1;
			}
			putchar('\n');
		}
	}
	else
	{
		vector<int>v;
		ll t=1ll*n*(n+1)/4-n;
		int len=n,cnt=0;
		while(t&&len)
		{
			int x=get(t,len);
			v.push_back(x);
			len-=x,t-=1ll*x*(x+1)/2;
		}
		while(cnt<n) v.push_back(1),++cnt;
		puts("Yes");
		int c=1;
		for(int x:v)
		{
			while(x--)
			{
				for(int i=1;i<=m;++i)
					putchar(c+'0'),putchar(' ');
				putchar('\n');
			}
			c^=1;
		}
	}
}
int main()
{
	int T;read(T);
	while(T--) solve();
	return 0;
}