#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<queue>
#include<stack>
#include<vector>
#include<utility>

using namespace std;

#define rep(i,l,r) for(int i=l;i<=r;i++)
#define lop(i,r,l) for(int i=r;i>=l;i--)
#define inf 0x3f3f3f3f3f3f3f3f
#define mk(a,b) make_pair(a,b)
#define pb(x) push_back(x)
#define deb(x,s) cout<<s<<": "<<x<<endl;
#define ios ios::sync_with_stdio(false);cin.tie(nullptr),cout.tie(nullptr);
#define i8 __int128
typedef long long ll;
typedef double db;
typedef long double ldb;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = 1e3 + 10;
int a[N][N], n, m;
void solve() {
	cin >> n >> m;
	int c = 0;
	if (n > m) {
		rep(i, 1, n) {
			rep(j, 1, m) {
				a[i][j] = ++c;
			}
		}
	}
	else {
		rep(j, 1, m) {
			rep(i, 1, n) {
				a[i][j] = ++c;
			}
		}
	}
	cout << "yes\n";
	rep(i, 1, n) {
		rep(j, 1, m) {
			cout << a[i][j] << " ";
		}
		cout << '\n';
	}
}

int main() {
	ios;
	int __;
	//__ = 1;
	cin >> __;
	while (__--) {
		solve();
	}
	return 0;
}