#include <bits/stdc++.h>
#define FASTIO ios::sync_with_stdio (0), cin.tie (0), cout.tie (0)
#define rep(i, l, r) for (int i = l; i <= r; i ++)
#define per(i, l, r) for (int i = r; i >= l; i --)
#define LL long long
#define PII pair<int,int>
using namespace std;
const int N = 1e5+5, mod = 998244353;
int n, m;
inline void put(int tt, int n, int m) {
	if (m % 4 == 0) {
		rep(i, 1, n) {
			for (int j = 0; j < m; j+=4)
				++tt, cout << tt << ' ' << tt << ' ' << tt << ' ' << tt << ' ';
			cout << '\n';
		}
		return ;
	}
	for (int i = 0; i < n; i+=4, tt += m) {
		rep(k, 1, 4) rep(j, 1, m)
		cout << tt+j<<(j == m ? '\n' :' ');
	}
}
int mp[2][N];
inline void solve() {
	cin >> n >> m;
	if (m % 4 == 0 || n%4==0) {
		cout << "YES\n";
		put(0, n, m);
		return ;
	}
	if ((n & 1)||(m&1)) {
		cout << "NO\n";
	} else {
		if (n == 2 && m == 2) return void(cout << "NO\n");
		cout << "YES\n";
		int tt = 0;
		if (m == 2) {
			++tt, mp[0][1] = mp[0][2] = mp[0][3] = tt;
			for (int j = 3; j < n-3; j+=4)
				mp[0][j+1] = mp[0][j+2] = mp[0][j+3] = mp[0][j+4] = ++tt;
			mp[0][n-2] = mp[0][n-1] = mp[0][n] = ++tt;
			mp[1][1] = 1, mp[1][n] = tt;
			for (int j = 1; j < n-1; j+=4)
				mp[1][j+1] = mp[1][j+2] = mp[1][j+3] = mp[1][j+4] = ++tt;
			rep(i, 1, n)
				cout << mp[0][i] << ' ' << mp[1][i] << '\n';
				
		} else {
			++tt, cout << tt << ' ' << tt << ' ' << tt << ' ';
			for (int j = 3; j < m-3; j += 4)
				++tt, cout << tt << ' ' << tt << ' ' << tt << ' ' << tt << ' ';
			++tt, cout << tt << ' ' << tt << ' ' << tt << '\n';
			int tmp = tt;
			cout << "1 ";
			for (int j = 1; j < m-1; j += 4)
				++tt, cout << tt << ' ' << tt << ' ' << tt << ' ' << tt << ' ';
			cout << tmp << '\n';
			put(tt, n-2, m);
		}
	}
}
int main () {
//	freopen(".in", "r", stdin);
//	freopen(".out", "w", stdout);
	FASTIO;
	int _;
	cin >> _;
	while (_--) solve(); 
	return 0;
}