#include <bits/stdc++.h>

#define maxn 5000005
#define ll long long

using namespace std;

int n, m;
int a[maxn];

ll c(int x) {
	return 1ll * x * (x + 1) / 2;
}

int main() {
	int t;
	scanf("%d", &t);
	while (t--) {
		scanf("%d%d", &n, &m);
		if (c(n) % 2 && c(m) % 2) {
			puts("No");
			continue;
		}
		puts("Yes");
		if (c(n) & 1) {
			ll s = c(m) / 2;
			int w = 0;
			int f = 0;
			for (int i = m / 2 + 1; i; i--) {
				while (s > c(i) || (s == c(i) && w + i == m)) {
//					cout<<"@"<<i<<endl;
					s -= c(i);
					for (int j = 1; j <= i; j++) a[++w] = f;
					f ^= 1;
				}
			}
//			cout<<s<<endl;
//			for (int w = 1; w <= )
			for (int i = 1; i <= n; i++) {
				for (int j = 1; j <= m; j++) {
					printf("%d ", a[j]);
				}
				puts("");
			}
//			assert(w == m);
		}
		else {
			ll s = c(n) / 2;
			int w = 0;
			int f = 0;
			for (int i = n / 2 + 1; i; i--) {
				while (s > c(i) || (s == c(i) && w + i == n)) {
					s -= c(i);
					for (int j = 1; j <= i; j++) a[++w] = f;
					f ^= 1;
				}
			}
			for (int i = 1; i <= n; i++) {
				for (int j = 1; j <= m; j++) {
					printf("%d ", a[i]);
				}
				puts("");
			}
		}
	}
	
	
	return 0;
}