#include <bits/stdc++.h>

using i64 = long long;
using u64 = unsigned long long;

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

    if(n * m & 1) {
        std::cout << "NO" << '\n';
        return;
    }

    if(n % 4 == 0 or m % 4 == 0) {
        bool is = false;
        if(n % 4 != 0) {
            is = true;
            std::swap(n, m);
        }
        std::vector<std::vector<int>> g(n, std::vector<int>(m));
        int now = 1;
        for(int i = 0; i < n; i ++ ) {
            for(int j = 0; j < m; j ++ ) {
                if(i % 4 == 0) {
                    g[i][j] = now ++;
                } else {
                    g[i][j] = g[i - 1][j];
                }
            }
        }
        std::cout << "YES" << '\n';
        if(is) std::swap(n, m);
        for(int i = 0; i < n; i ++ ) {
            for(int j = 0; j < m; j ++ ) {
                if(is) {
                    std::cout << g[j][i] << " \n"[j == m - 1];
                } else {
                    std::cout << g[i][j] << " \n"[j == m - 1];
                }
            }
        }
    } else if(n % 2 == 0 and m % 2 == 0) {
        int now = 1;
        bool is = false;
        if(n <= 4 and m <= 4) {
            std::cout << "NO" << '\n';
            return;
        } else if(n < m) {
            is = true;
            std::swap(n, m);
        }
        std::vector<std::vector<int>> g(n, std::vector<int>(m));
        for(int j = 0; j < m; j += 2) {
            g[0][j] = now;
            g[0][j + 1] = now;
            g[1][j] = now;
            g[2][j] = now;
            now += 1;

            g[n - 1][j] = now;
            g[n - 1][j + 1] = now;
            g[n - 2][j] = now;
            g[n - 3][j] = now;
            now += 1;

            for(int i = 3; i <= n - 4; i ++ ) {
                if(i % 4 == 3) {
                    g[i][j] = now ++;
                } else {
                    g[i][j] = g[i - 1][j];
                }
            }
            for(int i = 1; i <= n - 2; i ++ ) {
                if(i % 4 == 1) {
                    g[i][j + 1] = now ++;
                } else {
                    g[i][j + 1] = g[i - 1][j + 1];
                }
            }
        }
        if(is) std::swap(n, m);
        std::cout << "YES" << '\n';
        for(int i = 0; i < n; i ++ ) {
            for(int j = 0; j < m; j ++ ) {
                if(is) {
                    std::cout << g[j][i] << " \n"[j == m - 1];
                } else {
                    std::cout << g[i][j] << " \n"[j == m - 1];
                }
            }
        }
    } else {
        std::cout << "NO" << '\n';
        return;
    }

}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int T = 1;
    std::cin >> T;

    while(T -- ) {
        solve();
    }

    return 0;
}