#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 1e5;
namespace MY {
	template<typename t1> bool chkmax(t1&x, const t1&y) {return x < y ? x = y, 1 : 0 ; }
	template<typename t1> bool chkmin(t1&x, const t1&y) {return y < x ? x = y, 1 : 0 ; }
} using namespace MY;
int n, m, x, y, cnt; array<int, 3> a[MAXN + 3];
void cpput(int c, int tot) {
	for (int k = 0; k < tot; ++k) cout << c << ' ';
}
void solve() {
//	cerr << "-------------------------------------" << endl;
	cin >> n >> m, cnt = 0;
	if (n * m % 4 != 0) return cout << "NO\n", void();
	if (n == 2 && m == 2) return cout << "NO\n", void();
	if (n % 4 == 0) {
		cout << "YES\n";
		for (int i = 0; i < (n >> 2); ++i) {
			for (int k = 0; k < 4; ++k)
				for (int j = 1; j <= m; ++j) cout << j + i * m << (j == m ? '\n' : ' ');
		}
		return;
	}
	if (m % 4 == 0) {
		cout << "YES\n";
		for (int i = 1; i <= n; ++i) {
			for (int j = 0; j < (m >> 2); ++j) cpput(++cnt, 4);; cout << '\n'; 
		} 
		return;
	}
	if (m == 2) {
		y = 1, x = (n - 6 * y) / 4;
		cout << "YES\n";
		for (int j = 0; j < x; ++j) {
			cnt += 2;
			for (int k = 0; k < 4; ++k) cout << cnt - 1 << ' ' << cnt << '\n';
		}
		for (int j = 0; j < y; ++j) {
			cnt += 3;
			cout << cnt - 2 << ' ' << cnt - 2 << '\n';
			cout << cnt - 2 << ' ' << cnt - 0 << '\n';
			cout << cnt - 2 << ' ' << cnt - 0 << '\n';
			cout << cnt - 1 << ' ' << cnt - 0 << '\n';
			cout << cnt - 1 << ' ' << cnt - 0 << '\n';
			cout << cnt - 1 << ' ' << cnt - 1 << '\n';
		}
		return;
	}
	if (n % 2 == 0 && m % 2 == 0) {
		y = 1, x = (m - 6 * y) / 4;
		if (4 * x + 6 * y != m) exit(1);
//		for (x = 0, y = 0; 4 * x <= m; ++x) if ( == 0) {y = (m - 4 * x) / 6; break;}
		cout << "YES\n";
		for (int i = 1; i <= n; i += 2) {
			/*x*/for (int j = 0; j < x; ++j) cpput(++cnt, 4), j == x - 1 && y == 0 ? cout << '\n', 1 : 0; 
			for (int j = 0; j < y; ++j) {
				a[j] = {cnt + 1, cnt + 2, cnt + 3}, cnt += 3;
				cpput(a[j][0], 3), cpput(a[j][1], 3);
				if (j == y - 1) cout << '\n';
			} 
			/*x*/for (int j = 0; j < x; ++j) cpput(++cnt, 4), j == x - 1 && y == 0 ? cout << '\n', 1 : 0; 
			for (int j = 0; j < y; ++j) {
				cpput(a[j][0], 1), cpput(a[j][2], 4), cpput(a[j][1], 1);
				if (j == y - 1) cout << '\n';
			}
		}
		return;
	}
	cout << "NO\n";
}
int main() {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#ifdef MYFRE
	freopen("0.in", "r", stdin), freopen("0.out", "w", stdout);
#endif
	int t; cin >> t; while (t--) solve();//, cout << '\n';
}