// Cirno is not baka!
#include <bits/stdc++.h>
#define For(i, a, b) for (int i = (a); i <= (int)(b); ++i)
#define Rof(i, a, b) for (int i = (a); i >= (int)(b); --i)
#define Debug(...) { \
    fprintf(stderr, "Function{%s},line[%d]:\t", __FUNCTION__, __LINE__); \
    fprintf(stderr, __VA_ARGS__); \
    fprintf(stderr, "\n"); \
}
#define FILE(filename) { \
    freopen(#filename ".in", "r", stdin); \
    freopen(#filename ".out", "w", stdout); \
}
#define All(x) x.begin(), x.end()
#define rAll(x) x.rbegin(), x.rend()
#define pii pair<int, int>
#define fi first
#define se second
#define i64 long long
#define mkp make_pair
// #define int long long
using namespace std;

const int _N = 2e5 + 5, mod = 1e9 + 7;
template<typename T> void Max(T &x, T y) {x = max(x, y);}
template<typename T> void Min(T &x, T y) {x = min(x, y);}
template<typename T1, typename T2>
void Addmod(T1 &x, T2 y) {x += y; x >= mod ? x -= mod : x;}
template<typename T1, typename T2>
T1 Add(T1 x, T2 y) {x += y; return x >= mod ? x - mod : x;}

namespace BakaCirno {
    int N, M, K;
    vector<int> g[_N];
    int cnt = 0;
    void Init() {
        For(i, 1, N) {
            g[i].clear();
            g[i].resize(M+1, 0);
        }
        cnt = 0;
    }
    bool Check(int n, int m, int k) {
        if ((n&1) || (m&1)) return 0;
        if (k > n*m/4 || k == n*m/4-1) return 0;
        if (k < max(n, m)/2) return 0;
        if (n == m && k == n/2+1) return 0;
        return 1;
    }
    void Solve(int x, int y, int a, int b, int k) {
        int n = a-x+1, m = b-y+1;
        if (!n || !m) return ;
        if (Check(n-2, m-2, k-1)) {
            ++cnt;
            For(i, x, a) g[i][y] = g[i][b] = cnt;
            For(i, y, b) g[x][i] = g[a][i] = cnt;
            return Solve(x+1, y+1, a-1, b-1, k-1);
        }
        if (Check(n-2, m, k-m/2)) {
            for (int i = y; i <= b; i += 2)
                g[x][i] = g[x+1][i] = g[x][i+1] = g[x+1][i+1] = ++cnt;
            return Solve(x+2, y, a, b, k-m/2);
        }
        if (Check(n, m-2, k-n/2)) {
            for (int i = x; i <= a; i += 2)
                g[i][y] = g[i+1][y] = g[i][y+1] = g[i+1][y+1] = ++cnt;
            return Solve(x, y+2, a, b, k-n/2);
        }
        if (Check(n-2, m-2, k-n/2-m/2+1)) {
            for (int i = y; i <= b; i += 2)
                g[a][i] = g[a+1][i] = g[a][i+1] = g[a+1][i+1] = ++cnt;
            for (int i = x; i <= a-2; i += 2)
                g[i][y] = g[i+1][y] = g[i][y+1] = g[i+1][y+1] = ++cnt;
            return Solve(x+2, y+2, a, b, k-n/2-m/2+1);
        }
    }
    void Solve() {
        cin >> N >> M >> K;
        if (!Check(N, M, K)) return cout << "NO\n", void();
        cout << "YES\n";
        Init();
        Solve(1, 1, N, M, K);
        For(i, 1, N) {
            For(j, 1, M) cout << g[i][j] << ' ';
            cout << '\n';
        }
    }
}

signed main() {
    // FILE(t);
    cin.tie(0)->sync_with_stdio(0); int T = 1;
    cin >> T;
    while (T--) BakaCirno::Solve();
}