#include <bits/stdc++.h>
#define LL long long
#define db double
using namespace std;

const int N = 1e6, MAXN = 1e6 + 5;
int T;
LL n, m;

LL a[MAXN];
int ans[MAXN], top;
int col[MAXN];

void solve (int x, LL y) {
	for (int i = x; i >= 1; --i)
		while (x - i >= 0 && x - i <= y - a[i]) {
			ans[++top] = i;
			x -= i, y -= a[i];
		}
	int flg = 0, ps = 1;
	for (int i = 1; i <= top; ++i) {
		while (ans[i]--) {
			col[ps++] = flg;
		}
		flg ^= 1;
	}
}

int main() {
	int i,j,k;
	cin >> T;
	for (i = 1; i <= N; ++i)
		a[i] = a[i - 1] + i;
	while (T--) {
		cin >> n >> m;
		top = 0;
		if ((a[n] & 1) == 0) {
			solve (n, a[n] / 2);
			puts ("Yes");
			for (i = 1; i <= n; ++i, puts (""))
				for (j = 1; j <= m; ++j)
					printf ("%d ", col[i]);
		}
		else if ((a[m] & 1) == 0) {
			solve (m, a[m] / 2);
			puts ("Yes");
			for (i = 1; i <= n; ++i, puts (""))
				for (j = 1; j <= m; ++j)
					printf ("%d ", col[j]);
		}
		else puts ("No");
	}
	return 0;
}