#include <bits/stdc++.h>

#define int int64_t
using namespace std;

vector<vector<int> > solve1(int n, int m) {
	vector<vector<int> > a(n, vector<int>(m));
	int c = 1;
	for(int i=0; i<n; ++i) {
		for(int j=0; j<m; ++j) {
			a[i][j]=c++;
		}
	}
	return a;
}
vector<vector<int> > solve2(int n, int m) {
	vector<vector<int> > a(n, vector<int>(m));
	int c = 1;
	for(int i=0; i<m; ++i) {
		for(int j=0; j<n; ++j) {
			a[j][i]=c++;
		}
	}
	return a;
}
bitset<2000000> s;
void reset(vector<vector<int> >& a) {
	int n = a.size();
	int m = a[0].size();
	for(int i=0; i<n; ++i) {
		for(int j=0; j<m; ++j) {
			if(i<n-1) {
				int o = a[i][j]+a[i+1][j];
				s[o]=0;
			}
			if(j<m-1) {
				int o = a[i][j]+a[i][j+1];
				s[o]=0;
			}
		}
	}
}
bool check(vector<vector<int> >& a) {
	int n = a.size();
	int m = a[0].size();
	for(int i=0; i<n; ++i) {
		for(int j=0; j<m; ++j) {
			if(i<n-1) {
				int o = a[i][j]+a[i+1][j];
				if(s[o]) {reset(a); return 0;}
				s[o]=1;
			}
			if(j<m-1) {
				int o = a[i][j]+a[i][j+1];
				if(s[o]) {reset(a); return 0;}
				s[o]=1;
			}
		}
	}
	reset(a);
	return 1;
}

signed main() {
	cin.tie(0);
	ios_base::sync_with_stdio(0);

	/*for(int sum=2; sum<11; ++sum) {
		for(int i=1; i<sum; ++i) {
			int j=sum-i;
			auto a = solve1(i,j);
			auto b = solve2(i,j);
			if(!check(a) && !check(b)) {
				cerr<<"Wrong "<<i<<' '<<j<<endl;
			}
		}
	}
	return 0;*/

	int t;
	cin>>t;
	while(t--) {
		int n,m;
		cin>>n>>m;
		auto a = solve1(n,m);
		if(!check(a)) a = solve2(n,m);
		if(!check(a)) {
			cout<<"No\n";
		} else {
		cout<<"Yes\n";
		for(int i=0; i<n; ++i) {
			for(int j=0; j<m; ++j) {
				cout<<a[i][j]<<' ';
			}
			cout<<'\n';
		}
		}
	}
	return 0;
}