#include <bits/stdc++.h>  
using namespace std;  

#define int long long  

void solve() {
	int n, m;
	cin >> n >> m;

	if ((n + 1) * n % 4 && (m + 1) * m % 4) {
		cout << "No\n";
		return;
	}
	
	bool f = false;
	if ((m + 1) * m % 4) {
		swap(n, m);
		f = true;
	}

	vector<vector<int>> a(n + 1, vector<int>(m + 1));
	int t = (m + 1) * m / 4 - m;
	int len = 0;
	vector<int> ans;

	while (t > 0 || len < m) {
		int l = 1, r = m + 1;
		while (l + 1 != r) {
			int mid = (l + r) / 2;
			if (mid * (mid - 1) / 2 <= t) {
				l = mid;
			} else {
				r = mid;
			}
		}
		t -= (l - 1) * l / 2;
		len += l;
		ans.push_back(l);
	}

	vector<int> x;

	int now = 1;
	for (int i = 0; i < ans.size(); i++) {
		for (int j = 0; j < ans[i]; j++) {
			x.push_back(now);
		}
		now ^= 1;
	}

	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			a[i][j] = x[j - 1];
		}
	}

	cout << "Yes\n";
	if (f) {
		for (int j = 1; j <= m; j++) {
			for (int i = 1; i <= n; i++) {
				cout << a[i][j] << " \n"[i == n];
			}
		}
	} else {
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= m; j++) {
				cout << a[i][j] << " \n"[j == m];
			}
		}
	}
}

signed main() {  
    ios::sync_with_stdio(false);
    cin.tie(nullptr);  

    int t;
    cin >> t;
    while (t--) {
    	solve();
    }

    return 0;
}