// Problem: F. Half Mixed
// Contest: Codeforces - The 2022 ICPC Asia Shenyang Regional Contest (The 1st Universal Cup, Stage 1: Shenyang)
// URL: https://codeforces.com/gym/104160/problem/F
// Memory Limit: 512 MB
// Time Limit: 2000 ms

/*
hxz还是爬的好
*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i,a,b) for(ll i=a;i<=b;i++)
#define wt int tt=d;while(tt--)
#define py puts("Yes")
#define pn puts("No")
#define pritnf printf
#define edfl endl
#define fe(i,e) for(int i=0;i<e.size();i++)
#define vi vector<ll>
inline ll rd() {
	ll x=0,f=1;
	char c=getchar();
	while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
	while(isdigit(c))x=x*10+c-'0',c=getchar();
	return x*f;
}
namespace binom{
	const ll Lim=300010,mod=998244353;
	ll jc[Lim],inv[Lim],inc[Lim];
	void pre(){
		jc[0]=jc[1]=inc[0]=inc[1]=inv[0]=inv[1]=1;
		f(i,2,Lim-1)jc[i]=jc[i-1]*i%mod,inv[i]=(mod-mod/i)*inv[mod%i]%mod,
		inc[i]=inc[i-1]*inv[i]%mod;
	}ll C(ll n,ll m){if(n<0||m<0||n<m)return 0;return jc[n]*inc[m]%mod*inc[n-m]%mod;}
}
// using namespace binom;
ll dx[4]={0,1,0,-1};
ll dy[4]={1,0,-1,0};
#define d rd()
#define pb push_back
// const ll N=300010;
// struct edge{ll v,w,nx;}e[N<<1];
// ll hd[N],cnt;
// void add(ll u,ll v,ll w){e[++cnt]=(edge){v,w,hd[u]};hd[u]=cnt;}
ll qp(ll a,ll b,ll p){
	ll ans=1;while(b){
		if(b&1)ans=ans*a%p;
		a=a*a%p;b>>=1;
	}return ans;
}
ll n,m;
ll o[10000010];
bool f;
void dfs(ll u,ll x,ll y){
	// cout<<u<<" "<<x<<" "<<y<<endl;
	if(x==0){
		if(y!=0)return;
		f=1;return;
	}if(x<y)return;
	for(ll i=min((ll)sqrt(x*2),min(o[u-1],y));i>=1;i--){
		ll p=i*(i+1)/2;
		o[u]=i,dfs(u+1,x-p,y-i);
		if(f)return;
	}
}
int main(){
	wt{
		n=d,m=d;f=0;
		if(n%4==0||n%4==3){
			o[0]=10000000;
			// cout<<n*(n+1)/4<<" "<<n<<endl;
			dfs(1,(n*(n+1))/4,n);
			py;ll c=1,k=0,r=0;
			f(i,1,n){
				k++;f(j,1,m)putchar('0'+r),putchar(' ');puts("");
				if(k==o[c])c++,k=0,r=!r;
			}
		}
		else if(m%4==0||m%4==3){
			o[0]=10000000;
			dfs(1,(m*(m+1))/4,m);
			py;
			f(i,1,n){ll c=1,k=0,r=0;
				f(j,1,m){
					k++;putchar('0'+r),putchar(' ');
					if(k==o[c])c++,k=0,r=!r;
				}puts("");
			}
			
		}else pn;
	}
	return 0;
}
/*
wy还是爬的好
*/