#include <bits/stdc++.h>
using namespace std;
#define int long long
int a[1010][1010];
void solve()
{
    int n, m;
    cin >> n >> m;
    int id = 1, id2 = 2;
    for (int i = 1; i <= n/2*2; i++)
    {
        if (i % 2)
        {
            for (int j = 1; j <= m; j++)
            {
                a[i][j] = id;
                id += 2;
            }
        }
        else
        {
            for (int j = 1; j <= m; j++)
            {
                a[i][j] = id2;
                id2 += 2;
            }
        }
    }
    if(n%2){
        for(int i=1;i<=m;i++){
            if(id<=n*m){
                a[n][i]=id;
                id+=2;
            }
            else {
                a[n][i]=id2;
                id2+=2;
            }
        }
        for(int i=1;i<=m;i++){
            if(a[n][i]%2==0){
                if(a[n][i]+a[n-1][i]==a[n-1][m-1]+a[n-1][m]){
                    swap(a[n][i],a[n][i-1]);
                }
                break;
            }
        }
    }
    cout<<"YES"<<'\n';
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cout<<a[i][j]<<' ';
        }
        cout<<'\n';
    }
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin >> t;
    while (t--)
    {
        solve();
    }
}