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

using ll = long long;
using ld = long double;

#define all(x) (x).begin(), (x).end()

vector<vector<int>> solve(int n, int m) {
    vector<vector<int>> ans(n, vector<int>(m));

    // Conditions from the original code:
    // 1) If n == 1 or m == 1 or m is even, fill in simple row-major order
    if (n == 1 || m == 1 || m % 2 == 0) {
        int cur = 1;
        for (int i = 0; i < n; ++i)
            for (int j = 0; j < m; ++j)
                ans[i][j] = cur++;
        return ans;
    }

    // 2) If n is even and m is odd, fill in column-major order
    if (n % 2 == 0) {
        int cur = 1;
        for (int j = 0; j < m; ++j)
            for (int i = 0; i < n; ++i)
                ans[i][j] = cur++;
        return ans;
    }

    // 3) If both n and m are odd:
    // Use the cyclic shift approach described.
    {
        // Fill in row-major order
        int cur = 1;
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < m; ++j) {
                ans[i][j] = cur++;
            }
        }

        // For every even row (1-based index), cyclically shift by one position
        // i.e., for i = 1, 3, ... (0-based means i = 1, 3,... for the second, fourth row, etc.)
        for (int i = 1; i < n; i += 2) {
            // Shift ans[i] by one to the left
            int first_val = ans[i][0];
            for (int j = 0; j < m - 1; ++j) {
                ans[i][j] = ans[i][j + 1];
            }
            ans[i][m - 1] = first_val;
        }

        return ans;
    }
}

bool check_unique_adj_sums(const vector<vector<int>> &ans) {
    int n = (int)ans.size();
    int m = (int)ans[0].size();
    unordered_set<int> seen;

    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            // Check right neighbor
            if (j + 1 < m) {
                int sum_right = ans[i][j] + ans[i][j + 1];
                if (seen.find(sum_right) != seen.end()) return false;
                seen.insert(sum_right);
            }
            // Check down neighbor
            if (i + 1 < n) {
                int sum_down = ans[i][j] + ans[i + 1][j];
                if (seen.find(sum_down) != seen.end()) return false;
                seen.insert(sum_down);
            }
        }
    }

    return true;
}

int main() {
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
#endif
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int t;
    cin >> t;
    while (t--) {
        int n, m;
        cin >> n >> m;

        auto ans = solve(n, m);
        bool unique = check_unique_adj_sums(ans);

        cout << (unique ? "yes\n" : "no\n");
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < m; ++j)
                cout << ans[i][j] << (j + 1 == m ? '\n' : ' ');
        }
    }

    return 0;
}