#line 1 "M.cpp"
// #pragma GCC target("avx2,avx512f,avx512vl,avx512bw,avx512dq,avx512cd,avx512vbmi,avx512vbmi2,avx512vpopcntdq,avx512bitalg,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("Ofast")

#line 2 "/home/sigma/comp/library/template.hpp"

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) c.begin(),c.end()
#define si(x) int(x.size())
#define pb push_back
#define eb emplace_back
#define fs first
#define sc second
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T>>;
template<class T,class U> bool chmax(T& x, U y){
	if(x<y){ x=y; return true; }
	return false;
}
template<class T,class U> bool chmin(T& x, U y){
	if(y<x){ x=y; return true; }
	return false;
}
template<class T> void mkuni(V<T>& v){sort(all(v));v.erase(unique(all(v)),v.end());}
template<class T> int lwb(const V<T>& v, const T& a){return lower_bound(all(v),a) - v.begin();}
template<class T>
V<T> Vec(size_t a) {
    return V<T>(a);
}
template<class T, class... Ts>
auto Vec(size_t a, Ts... ts) {
  return V<decltype(Vec<T>(ts...))>(a, Vec<T>(ts...));
}
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){
	return o<<"("<<p.fs<<","<<p.sc<<")";
}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){
	o<<"{";
	for(const T& v:vc) o<<v<<",";
	o<<"}";
	return o;
}
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

#ifdef LOCAL
#define show(x) cerr << "LINE" << __LINE__ << " : " << #x << " = " << (x) << endl
void dmpr(ostream& os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ~ ";
	dmpr(os,args...);
}
#define shows(...) cerr << "LINE" << __LINE__ << " : ";dmpr(cerr,##__VA_ARGS__)
#define dump(x) cerr << "LINE" << __LINE__ << " : " << #x << " = {";  \
	for(auto v: x) cerr << v << ","; cerr << "}" << endl;
#else
#define show(x) void(0)
#define dump(x) void(0)
#define shows(...) void(0)
#endif

template<class D> D divFloor(D a, D b){
	return a / b - (((a ^ b) < 0 && a % b != 0) ? 1 : 0);
}
template<class D> D divCeil(D a, D b) {
	return a / b + (((a ^ b) > 0 && a % b != 0) ? 1 : 0);
}
#line 5 "M.cpp"

bool ok(VV<int> a){
	int H = si(a), W = si(a[0]), N = H*W;
	V<bool> used(N+N+2);
	rep(i,H) rep(j,W){
		if(i != H-1){
			if(used[a[i][j] + a[i+1][j]]) return false;
			used[a[i][j] + a[i+1][j]] = true;
		}
		if(j != W-1){
			if(used[a[i][j] + a[i][j+1]]) return false;
			used[a[i][j] + a[i][j+1]] = true;
		}
	}
	return true;
}

void solve(int H, int W){
	bool swapped = false;
	if(H%2) swap(H,W), swapped = true;
	VV<int> a(H,V<int>(W));
	if(H%2 == 0 && W%2 == 0){
		rep(i,H) rep(j,W) a[i][j] = i*W+j+1;
	}else{
		rep(i,H) rep(j,W) a[i][j] = i*W+j+1;
		rep(i,H) if(i%2) rotate(a[i].begin(),a[i].begin()+1,a[i].end());
	}
	// if(!ok(a)){
	// 	cerr << H << ' ' << W << endl;
	// 	rep(i,H) rep(j,W) cerr << a[i][j] << " \n"[j==W-1];
	// }
	if(swapped){
		VV<int> b(W,V<int>(H));
		rep(i,H) rep(j,W) b[j][i] = a[i][j];
		swap(H,W);
		a = b;
	}
	cout << "YES\n";
	rep(i,H) rep(j,W) cout << a[i][j] << " \n"[j==W-1];
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);		//DON'T USE scanf/printf/puts !!
	cout << fixed << setprecision(20);

	// rep1(H,10) rep1(W,10) solve(H,W);
	// cerr << "OK" << endl;

	int T; cin >> T;
	while(T--){
		int H,W; cin >> H >> W;
		solve(H,W);
	}
}