#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 = 200005;
const ll mod = 998244353;
ll T;
ll n, m;
ll a[100][100];

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 x, ll y){
//	cout << x << " " << y << endl;
	if(x == n+1){
		ll cnt = 0; bool ff = 1, ff1 = 1;
		for(ll i = 1; i <= n; i++){
			for(ll j = 1; j <= m; j++){
				ll cnt0 = 0, cnt1 = 0;
				for(ll ii = i; ii <= n; ii++){
					for(ll jj = j; jj <= m; jj++){
						if(a[ii][jj]) cnt1++;
						else cnt0++;
						if(cnt0 == 0 || cnt1 == 0) cnt++;
					}
				}
			}
		}
		for(ll j = 1; j <= m; j++){
			ll cnt1 = 0, cnt0 = 0;
			for(ll i = 1; i <= n; i++){
				if(a[i][j]) cnt1++;
				else cnt0++;
			}
			if(cnt0 && cnt1){
				ff = 0;
				break;
			}
		}
		for(ll i = 1; i <= n; i++){
			ll cnt1 = 0, cnt0 = 0;
			for(ll j = 1; j <= m; j++){
				if(a[i][j]) cnt1++;
				else cnt0++;
			}
			if(cnt0 && cnt1){
				ff1 = 0;
				break;
			}
		}
//		cout << cnt << endl;
		if(cnt == n*(n+1)/2*m*(m+1)/2/2 && (ff || ff1)){
			for(ll i = 1; i <= n; i++){
				for(ll j = 1; j <= m; j++){
					printf("%d ", a[i][j]);
				}
				puts("");
			}
			cout << endl;
		}
		return;
	}
	if(y != m){
		a[x][y] = 0;
		dfs(x, y+1);
		a[x][y] = 1;
		dfs(x, y+1);
	}	
	else{
		a[x][y] = 0;
		dfs(x+1, 1);
		a[x][y] = 1;
		dfs(x+1, 1);
	}
}

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{
			bool ff = 0;
			for(ll i = 1; i <= n; i++){
				for(ll j = i; j <= n; j++){
					if((j-i+1)*(j-i+2)*2+2*(n-j)*(n-j+1)+2*i*(i-1) == n*(n+1)){
						ff = 1;
						printf("Yes\n");
						for(ll ii = 1; ii <= n; ii++){
							for(ll jj = 1; jj <= m; jj++){
								if(ii >= i && ii <= j) printf("1 ");
								else printf("0 ");
							}
							puts("");
						}
					}
				}
				if(ff) break;
			}
			for(ll i = 1; i <= m; i++){
				if(ff) break;
				for(ll j = i; j <= m; j++){
					if((j-i+1)*(j-i+2)*2+2*(m-j)*(m-j+1)+2*i*(i-1) == m*(m+1)){
						ff = 1;
						printf("Yes\n");
						for(ll ii = 1; ii <= n; ii++){
							for(ll jj = 1; jj <= m; jj++){
								if(jj >= i && jj <= j) printf("1 ");
								else printf("0 ");
							}
							puts("");
						}
					}
				}
				if(ff) break;
			}
			if(!ff) printf("No\n");
		}
	}
	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
*/