#include <bits/stdc++.h>

#include <chrono>
std::mt19937 eng(std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l, int r) { return std::uniform_int_distribution<int>(l, r)(eng); }

namespace FastIO {
//	char buf[1 << 21], *p1 = buf, *p2 = buf;
//	#define getchar() (p1 == p2 && (p1 = buf, p2 = (p1 + fread(buf, 1, 1 << 21, stdin))) == p1 ? EOF : *p1++)
	template <typename T> inline T read() { T x = 0, w = 0; char ch = getchar(); while (ch < '0' || ch > '9') w |= (ch == '-'), ch = getchar(); while ('0' <= ch && ch <= '9') x = x * 10 + (ch ^ '0'), ch = getchar(); return w ? -x : x; }
	template <typename T> inline void write(T x) { if (!x) return; write<T>(x / 10), putchar((x % 10) ^ '0'); }
	template <typename T> inline void print(T x) { if (x > 0) write<T>(x); else if (x < 0) putchar('-'), write<T>(-x); else putchar('0'); }
	template <typename T> inline void print(T x, char en) { print<T>(x), putchar(en); }
//	inline char rChar() { char ch = getchar(); while (!isalpha(ch)) ch = getchar(); return ch; }
}; using namespace FastIO;

#define MAXN 1001
int a[MAXN][MAXN];
void solve() {
	int n = read<int>(), m = read<int>(), cnt = 0;
	if (n == 1) {
		puts("Yes");
		for (int i = 1; i <= m; ++i) print<int>(i, " \n"[i == m]);
		return; 
	} if (m == 1) {
		puts("Yes");
		for (int i = 1; i <= n; ++i) print<int>(i, '\n');
		return;
	}
	puts("Yes");
	if ((n & 1) && (m & 1)) {
		for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) a[i][j] = ++cnt;
		for (int i = 2; i <= n; i += 2) 
			for (int j = 1; j < m; ++j) std::swap(a[i][j], a[i][j + 1]);
	} else if (n & 1) {
		for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) a[i][j] = ++cnt; 
	} else {
		for (int j = 1; j <= m; ++j) for (int i = 1; i <= n; ++i) a[i][j] = ++cnt;
	}
	for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) print<int>(a[i][j], " \n"[j == m]);
}

int main() { int T = read<int>(); while (T--) solve(); return 0; }