#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define l(x) (x<<1)
#define r(x) (x<<1|1)
#define mpr make_pair
//mt19937_64 ra(time(0) ^ (*new char));
//ios::sync_with_stdio(false);
//cin.tie(0); cout.tie(0);
const ll SIZE = 1000005;
const ll mod = 998244353;
ll T;
ll n, m;
ll a[SIZE], tot;
bool ff ;

inline ll rd(){
	ll 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 power(ll x, ll y){
	ll jl = 1;
	while(y){
		if(y & 1) jl = (jl * x) % mod;
		x = (x * x) % mod;
		y >>= 1;
	}
	return jl;
}

void dfs(ll las, ll ss, ll mb){
//	cout<<las<<" "<<ss<<endl;
	if(las == 0){
		if(ss == mb) ff = 1;
		return;
	}
	if(ss > mb || ss + las < mb) return;
	for(int i = min(min((ll)floor(sqrt((double)las)), a[tot]), mb-ss); i >= 1; i--){
		ss += i;
		a[++tot] = i;
		dfs(las-i*i, ss, mb);
		if(ff) return;
		ss -= i, tot--;
	}
}

int main(){
//	freopen("My.out", "w", stdout);
	T = rd();
	while(T--){
		n = rd(), m = rd();
		if(((n*(n+1)/2)&1) && ((m*(m+1)/2)&1)) printf("No\n");
		else{
			printf("Yes\n");
			ff = 0; a[0] = (1ll<<30);
			if(n*(n+1)%4 == 0){
				tot = 0;
				dfs(n*(n-1)/2, 0, n);
//				cout<<"zrdz\n";
				ll now = 0, hh = 1, uu = 1;
				for(ll i = 1; i <= n; i++){
					now++;
					if(now > a[hh]) now = 1, hh++, uu = !uu;
					for(ll j = 1; j <= m; j++) printf("%d ", uu);
					puts("");
				}
			}
			else{
				tot = 0;
				dfs(m*(m-1)/2, 0, m);				
				for(ll i = 1; i <= n; i++){
					ll now = 0, hh = 1, uu = 1;
					for(ll j = 1; j <= m; j++){
						now++;
						if(now > a[hh]) now = 1, hh++, uu = !uu;
						printf("%d ", uu);
					}
					puts("");
				}
			}
		}
	}
	return 0;
}

/*
19
1 1
1 2
1 3
1 4
1 5
1 6
2 2
2 3
2 4
2 5
2 6
3 3
3 4
3 5
3 6
4 4
4 5
4 6
5 5

5
2 6
2 7
2 8
2 9
2 10
*/