#include<iostream>
#include<algorithm>
#include<vector>
#define int long long
using namespace std;

void solve() {
	int n = 0, m = 0;
	cin >> n >> m;
	int N = (n + 1) * n / 2, M = (m + 1) * m / 2;
	if ((N & 1) && (M & 1)) {
		cout << "No\n";
		return;
	}
	cout << "Yes\n";
	int x = m;
	if (M & 1) {
		x = n;
	}
	int total = (x + 1) * x / 4;
	vector<int>a;
	a.push_back(0);
	int num = 0,flag = 1;
	while (num < x) {
		int left = 1, right = x + 1,ans = 0;
		while (left <= right) {
			int mid = (left + right) >> 1;
			if ((mid + 1) * mid / 2 >= total - (x - num)) {
				right = mid - 1;
				ans = mid;
			}
			else {
				left = mid + 1;
			}
		}
		for (int i = 0; i < ans; i++) {
			a.push_back(flag);
		}
		flag ^= 1;
		num += ans;
		total -= ans * (ans + 1) / 2;
	}
	vector<vector<int>>v(n + 1, vector<int>(m + 1,0));
	if (x == m) {
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= m; j++) {
				cout << a[j];
				if (j < m) {
					cout << ' ';
				}
				else {
					cout << '\n';
				}
			}
		}
	}
	else {
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= m; j++) {
				cout << a[i];
				if (j < m) {
					cout << ' ';
				}
				else {
					cout << '\n';
				}
			}
		}
	}
}

signed main() {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	int t = 0;
	cin >> t;
	while (t--) {
		solve(); 
	}
	return 0;
}