#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e6+5;
int t,n,m,a[N];
void calc(int n){
	ll need=1ll*n*(n+1)/4-n;
	int rem=n,o=0,t=0;
	for(int i=n;i>=1;i--){
		ll cur=1ll*i*(i+1)/2-i;
		while(cur<=need&&i<=rem){
			need-=cur,rem-=i,o^=1;
			for(int j=1;j<=i;j++) a[++t]=o;
		}
	}
}
signed main(){
	scanf("%d",&t);
	while(t--){
		scanf("%d%d",&n,&m);
		if(1ll*n*(n+1)%4==0){
			puts("Yes"),calc(n);
			for(int i=1;i<=n;i++,puts(""))
				for(int j=1;j<=m;j++) printf("%d ",a[i]);
		}
		else if(1ll*m*(m+1)%4==0){
			puts("Yes"),calc(m);
			for(int i=1;i<=n;i++,puts(""))
				for(int j=1;j<=m;j++) printf("%d ",a[j]);
		}
		else puts("No");
	}
	return 0;
}