#include<bits/stdc++.h>
#define all(x) std::begin(x), std::end(x)
using i64 = long long;
using ld = long double;

/*
3 * 4可以
3 * 3不行
模 4 有余则不行

考虑所有模 4 为 0 的非法方案
2 * 2 不行

2 * 6 可以
2 * 8 可以

就是说，如果长宽有任意一边，模 4 余 0，那么可以随意构造

如果双方模 4 都不余 0，那么必然是一对偶数

模 6 必然剩 4
所以分类即可
*/

int idx = 1;
// ====
void print1x4(std::vector<std::vector<int>>& a, int x, int y) {
    a[x][y] = idx;
    a[x][y + 1] = idx;
    a[x][y + 2] = idx;
    a[x][y + 3] = idx++;
}

void print4x1(std::vector<std::vector<int>>& a, int x, int y) {
    a[x][y] = idx;
    a[x + 1][y] = idx;
    a[x + 2][y] = idx;
    a[x + 3][y] = idx++;
}

void print2x6(std::vector<std::vector<int>>& a, int x, int y) {
    a[x][y] = idx;
    a[x + 1][y] = idx;
    a[x + 1][y + 1] = idx;
    a[x + 1][y + 2] = idx++;
    a[x][y + 5] = idx;
    a[x + 1][y + 5] = idx;
    a[x + 1][y + 4] = idx;
    a[x + 1][y + 3] = idx++;
    print1x4(a, x, y + 1);
}

void print6x2(std::vector<std::vector<int>>& a, int x, int y) {
    a[x][y] = idx;
    a[x][y + 1] = idx;
    a[x + 1][y + 1] = idx;
    a[x + 2][y + 1] = idx++;
    a[x + 5][y] = idx;
    a[x + 5][y + 1] = idx;
    a[x + 4][y + 1] = idx;
    a[x + 3][y + 1] = idx++;
    print4x1(a, x + 1, y);
}

void solve() {
    idx = 1;
    int n, m;
    std::cin >> n >> m;

    if (n * m % 4 || (n == 2 && m == 2)) {
        std::cout << "NO\n";
        return;
    }

    bool swa = (n > m);
    if (swa) std::swap(n, m);
    std::vector<std::vector<int>> a(n, std::vector<int>(m));
    
    if (n % 4 == 0) {
        for (int i = 0; i < n; i += 4) {
            for (int j = 0; j < m; j++) {
                print4x1(a, i, j);
            }
        }
    } else if (m % 4 == 0) {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j += 4) {
                print1x4(a, i, j);
            }
        }
    } else {
        if (n % 6 == 0) {
            for (int i = 0; i < n; i += 6) {
                for (int j = 0; j < m; j += 2) {
                    print6x2(a, i, j);
                }
            }
        } else if (m % 6 == 0) {
            for (int i = 0; i < n; i += 2) {
                for (int j = 0; j < m; j += 6) {
                    print2x6(a, i, j);
                }
            }
        } else {
                assert(m / 4 >= 2);
                int j = 0;
                for (; j + 8 < m; j += 4) {
                    for (int i = 0; i < n; i++) {
                        print1x4(a, i, j);
                    }
                }
                for (; j < m; j += 6) {
                    for (int i = 0; i < n; i += 2) {
                        print2x6(a, i, j);
                    }
                }
        }
    }

    std::cout << "YES\n";
    if (swa) {
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                std::cout << a[j][i] << " ";
            }
            std::cout << "\n";
        }
    } else {
        for (auto &v : a) {
            for (auto i : v) {
                std::cout << i << " ";
            }
            std::cout << "\n";
        }
    }
}

signed main() {
    std::ios::sync_with_stdio(0);
    std::cin.tie(0);
    std::cout.tie(0);
    int t = 1;
    std::cin >> t;
    while (t--) solve();
}

/*
3
2 3
2 4
6 8
*/