#include <bits/stdc++.h>
using namespace std;

#define debug(...) 42;
#ifdef LOCAL
#include "debug.h"
#endif

#define fi first
#define se second
#define pb push_back
#define ll long long
#define pii pair<int, int>
#define all(a) a.begin(), a.end()
#define rep(i, a, b) for(int i = a; i < b; ++i)
#define per(i, a, b) for(int i = a - 1; i >= b; --i)
template<typename T> bool setmin(T &a, T b) { return (a > b ? a = b, 1 : 0); }
template<typename T> bool setmax(T &a, T b) { return (a < b ? a = b, 1 : 0); }

#define vi vector<int>
#define vl vector<ll>
#define trav(it, a) for(auto& it: a)

template <typename T_vector> void rotate(std::vector<std::vector<T_vector>> &A) {
    if(empty(A)) return;
    int N = A.size(), M = A[0].size();
    std::vector<std::vector<T_vector>> res(M, std::vector<T_vector>(N));
    for (int i = 0;i < N;i ++)
        for (int j = 0;j < M;j ++)
            res[M - 1 - j][i] = A[i][j];
    A.swap(res);
}

void solve(){
    int n, m; cin >> n >> m;
    if(n <= 3 and m <= 3){
        cout << "NO\n";
        return;
    }
    vector<vi> ans(n, vi(m));
    int id = 1, cur = 0;
    if(n % 4 == 0){
        cout << "YES\n";
        rep(j,0,m) rep(i,0,n){
            ans[i][j] = id;
            if(++cur == 4){
                cur = 0;
                id++;
            }
        }
        rep(i,0,n) rep(j,0,m) cout << ans[i][j] << " \n"[j == m-1];
    }else if(m % 4 == 0){
        cout << "YES\n";
        rep(i,0,n) rep(j,0,m){
            ans[i][j] = id;
            if(++cur == 4){
                cur = 0;
                id++;
            }
        }
        rep(i,0,n) rep(j,0,m) cout << ans[i][j] << " \n"[j == m-1];
    }else{
        if(n % 2 == 0 and (m >= 4 and (m % 4 == 0 or m % 4 == 2))){
            cout << "YES\n";
            for(int i = 0; i < n; i += 2){
                for(int j = 0; j < m; j += 6){
                    if(m % 4 == 2 and (m - j) % 4 == 0) break;
                    rep(jj,j,j+3) ans[i][jj] = id;
                    ans[i+1][j] = id;
                    rep(jj,j+3,j+6) ans[i][jj] = id + 2;
                    ans[i+1][j+5] = id + 2;
                    rep(jj,j+1,j+5) ans[i+1][jj] = id + 1;
                    id += 3;
                }
            }
            if(m % 4 == 2){
                int cur = 0;
                rep(i,0,n) rep(j,0,m) if(!ans[i][j]){
                    ans[i][j] = id;
                    if(++cur == 4){
                        cur = 0;
                        id++;
                    }
                }
            }
        
            vector<vector<pii>> bel(id+1);
            rep(i,0,n) rep(j,0,m) bel[ans[i][j]].emplace_back(i, j);
            id = 1;
            vector<vi> vis(n, vi(m));
            rep(i,0,n) rep(j,0,m) if(!vis[i][j]){
                int t = ans[i][j];
                for(auto[x, y]: bel[t]){
                    vis[x][y] = 1;
                    ans[x][y] = id;
                }
                id++;
            }

            rep(i,0,n) rep(j,0,m) cout << ans[i][j] << " \n"[j == m-1];
        }else if(m % 2 == 0 and (n >= 4 and (n % 4 == 0 or n % 4 == 2))){
            cout << "YES\n";
            for(int j = 0; j < m; j += 2){
                for(int i = 0; i < n; i += 6){
                    debug(i);
                    if(n % 4 == 2 and (n - i) % 4 == 0) break;
                    rep(ii,i,i+3) ans[ii][j] = id;
                    ans[i][j+1] = id;
                    rep(ii,i+3,i+6) ans[ii][j] = id + 2;
                    ans[i+5][j+1] = id + 2;
                    rep(ii,i+1,i+5) ans[ii][j+1] = id + 1;
                    id += 3;
                }
            }
            if(n % 4 == 2){
                int cur = 0;
                 rep(j,0,m) rep(i,0,n) if(!ans[i][j]){
                    ans[i][j] = id;
                    if(++cur == 4){
                        cur = 0;
                        id++;
                    }
                }
            }
            vector<vector<pii>> bel(id+1);
            rep(i,0,n) rep(j,0,m) bel[ans[i][j]].emplace_back(i, j);
            id = 1;
            vector<vi> vis(n, vi(m));
            rep(i,0,n) rep(j,0,m) if(!vis[i][j]){
                int t = ans[i][j];
                for(auto[x, y]: bel[t]){
                    vis[x][y] = 1;
                    ans[x][y] = id;
                }
                id++;
            }
            rep(i,0,n) rep(j,0,m) cout << ans[i][j] << " \n"[j == m-1];
        }else{
            cout << "NO\n";
        }
    }
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int T; cin >> T;
    // rep(i,0,T){
    //     int n, m; cin >> n >> m;
    //     cout << (Solve(n, m) ? "YES" : "NO") << '\n';
    // }
    while(T--) solve();

    return 0;
}