// 
/*
世界の果てさえ
【世界的尽头在何处】
仆らは知らない
【我们也无从知晓】
*/
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <random>
#include <ctime>
#define pr pair <int, int>
#define mr make_pair
#define LL long long
#define ls tree[p].L
#define rs tree[p].R
using namespace std;
const int MAXN = 1e6 + 5;
int T, n, m, ans[MAXN];
void read(int &x) {
	x = 0; bool f = 1; char C = getchar();
	for(; C < '0' || C > '9'; C = getchar()) if(C == '-') f = 0;
	for(; C >= '0' && C <= '9'; C = getchar()) x = (x << 1) + (x << 3) + (C ^ 48);
	x = (f ? x : -x);
}
int check(int x) {
	return 1ll * (x + 1) * x / 2 % 2 == 0;
}
void solve(LL x) {
	int tot = 0, now = 0; x -= m;
	while(x) {
		LL l = 1, r = 1e9, mid, res = 0;
		while(l <= r) {
			mid = (l + r) >> 1;
			if(mid * (mid + 1) / 2 - mid <= x) res = mid, l = mid + 1;
			else r = mid - 1;
		}
		for(int i = 1; i <= res; i ++) ans[++ tot] = now;
//		printf("?%lld %d?", x, res);
		now ^= 1; x -= 1ll * res * (res + 1) / 2 - res;
	}
	while(tot < m) ans[++ tot] = now, now ^= 1;
} 
int main() {
	for(scanf("%d", &T); T; T --) {
		read(n); read(m); int lim = 0;
		if(!check(m)) swap(n, m), lim = 1;
		if(!check(m)) {
			printf("No\n"); continue;
		}
		solve(1ll * m * (m + 1) / 4); printf("Yes\n");
		if(lim) {
			for(int i = 1; i <= m; i ++) {
				for(int j = 1; j <= n; j ++) putchar(ans[i] + '0'), putchar(' ');
				putchar('\n');
			}
			continue;
		}
		for(int i = 1; i <= n; i ++) {
			for(int j = 1; j <= m; j ++) putchar(ans[j] + '0'), putchar(' ');
			putchar('\n');
		}
	}
	return 0;
}