#include <bits/stdc++.h>

using i64 = long long;
using A2 = std::array<i64, 2>;

#define Fast_IOS \
	std::ios::sync_with_stdio(false), \
	std::cin.tie(0), \
	std::cout.tie(0)

const i64 mod = 998244353;

class ICPC {
public:
	std::vector<int> ans;

	int N, T = 1;

	ICPC() {
		Fast_IOS;
		std::cin >> T;
		ans.resize(1e6 + 10);
	}

	void solve() {
		int n, m, rev = 0;
		std::cin >> n >> m;
		if (n * (n + 1) % 4 != 0 && m * (m + 1) % 4 != 0) {
			return (void)(std::cout << "No\n");
		}
		std::cout << "Yes\n";
		if (n * (n + 1) % 4 != 0) {
			std::swap(n, m);
			rev = 1;
		}
		int flag = 0;
		int t1 = n * (n + 1) / 4, t2 = n, t = n, cnt = 0;
		while (t1) {
			while (t1 - t * (t + 1) / 2 < t2 - t) t--;
			ans[++cnt] = t;
			t1 -= t * (t + 1) / 2;
			t2 -= t;
		}
		if (rev) {
			for (int i = 0; i < m; i++) {
				int t = 0;
				for (int k = 1; k <= cnt; k++) {
					int x = ans[k];
					t ^= 1;
					for (int j = 0; j < x; j++) {
						std::cout << t << ' ';
					}
				}
				std::cout << '\n';
			}
		} else {
			int t = 0;
			for (int k = 1; k <= cnt; k++) {
				int x = ans[k];
				t ^= 1;
				for (int i = 0; i < x; i++) {
					for (int j = 0; j < m; j++) {
						std::cout << t << ' ';
					}
					std::cout << '\n';
				}
			}
		}
	}
};

int main() {
	ICPC icpc;
	while (icpc.T--) {
		icpc.solve();
	}
	return 0;
}