#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb push_back
#define se second
#define fi first
const int mod = 1e9 + 7, N = 1e6 + 10;

//#define int long long
ll ksm(ll a, ll b) {
	ll ans = 1;
	while (b) {
		if (b & 1)
			ans = ans * a % mod;
		a = a * a % mod;
		b /= 2;
	}
	return ans;
}
int n, m;
ll su[N];

void init() {
	for (int i = 1 ; i < N ; i++) {
		su[i] = su[i - 1] + i;
	}
}

void solve() {


	cin >> n >> m;
	ll r = 1LL * n * (n + 1) / 2, c = 1LL * m * (m + 1) / 2;
	ll sum = r * c;
	if (sum & 1) {
		cout << "No\n";
		return;
	}
	int ok = 0;
	vector<int> ret;
	if (r & 1) {
		ok = 1;
		swap(n, m);
		ll s = c / 2 - n, cnt = 0;
		for (int i = n ; i >= 1 && s > 0 ; i--) {
			if (su[i] > s)
				continue;
			while (s >= su[i]) {
				s -= su[i];
				ret.push_back(i + 1);
				cnt += (i + 1);
			}
		}
		int x = n - cnt;
		while (x > 0) {
			ret.push_back(1);
			x--;
		}
	} else {
//		cout << "ok" << '\n';
//		return;
		ll s = r / 2 - n, cnt = 0;
		for (int i = n ; i >= 1 && s > 0 ; i--) {
			if (su[i] > s)
				continue;
			//cout << s << '\n';
			while (s >= su[i]) {
				s -= su[i];
				ret.push_back(i + 1);
				cnt += (i + 1);
			}
		}
		int x = n - cnt;
		while (x > 0) {
			ret.push_back(1);
			x--;
		}
	}

//	for (auto x : ret)
//		cout << x << '\n';


	cout << "Yes\n";
	if (ok) {
		int cur = 0, jishu = 0;
		vector<vector<int>> g(n + 1, vector<int>(m + 1));
		for (auto x : ret) {
			cur ^= 1;
			for (int i = 0 ; i < x ; i++) {
				for (int j = 0 ; j < m ; j++) {
					g[jishu][j] = cur;
				}
				jishu++;
			}
		}
		for (int i = 0 ; i < m ; i++) {
			for (int j = 0 ; j < n ; j++) {
				cout << g[j][i] << ' ';
			}
			cout << '\n';
		}
	} else {
		int cur = 0;
		for (auto x : ret) {
			cur ^= 1;
			for (int i = 0 ; i < x ; i++) {
				for (int j = 0 ; j < m ; j++) {
					cout << cur << ' ';
				}
				cout << '\n';
			}
		}
	}

}

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