#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:
	int N, T = 1;

	ICPC() {
		Fast_IOS;
		std::cin >> T;
	}

	void solve() {
		int n, m;
		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);
		}
		int flag = 0;
		std::vector<int> ans;
		int M = n * (n + 1) / 4;
		std::vector vis(M + 1, std::vector<int>(n + 1));
		auto dfs = [&](auto self, int rest, int x) -> void {
			// std::cout << rest << ' ' << x << '\n';
			if (flag || vis[rest][x]) {
				return;
			}
			vis[rest][x] = 1;
			if (rest == 0 || x == 0) {
				if (rest == 0 && x == 0) {
					flag = 1;
					std::vector<int> res;
					int j = 0;
					for (auto x : ans) {
						j ^= 1;
						for (int i = 0; i < x; i++) {
							res.push_back(j);
						}
					}
					for (int i = 0; i < m; i++) {
						for (auto x : res) {
							std::cout << x << ' ';
						}
						std::cout << '\n';
					}
				}
				return;
			}
			for (int i = x; i >= 1; i--) {
				if (i * (i + 1) / 2 > rest) continue;
				ans.push_back(i);
				self(self, rest - i * (i + 1) / 2, x - i);
				if (flag) break;
				ans.pop_back();
			}
		};
		dfs(dfs, M, n);
	}
};

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