#include <bits/stdc++.h>

using i64 = long long;

bool ok(int n, int m, int k) {
    if (n == 0 || m == 0) {
        return n == 0 && m == 0;
    }
    return n % 2 == 0 && m % 2 == 0 && std::max(n, m) / 2 <= k && k <= n * m / 4 && k != n * m / 4 - 1 && (n != m || k != n / 2 + 1);
}

void solve() {
    int N, M, K;
    std::cin >> N >> M >> K;
    
    if (!ok(N, M, K)) {
        std::cout << "NO\n";
        return;
    }
    
    std::cout << "YES\n";
    std::vector ans(N, std::vector<int>(M));
    auto rec = [&](auto self, int x1, int x2, int y1, int y2, int k) {
        if (x1 == x2 || y1 == y2) {
            return;
        }
        int n = x2 - x1;
        int m = y2 - y1;
        if (ok(n - 2, m, k - m / 2)) {
            self(self, x1 + 2, x2, y1, y2, k - m / 2);
            int cur = k - m / 2;
            for (int i = y1; i < y2; i += 2) {
                ans[x1][i] = ans[x1][i + 1] = ans[x1 + 1][i] = ans[x1 + 1][i + 1] = ++cur;
            }
        } else if (ok(n, m - 2, k - n / 2)) {
            self(self, x1, x2, y1 + 2, y2, k - n / 2);
            int cur = k - n / 2;
            for (int i = x1; i < x2; i += 2) {
                ans[i][y1] = ans[i][y1 + 1] = ans[i + 1][y1] = ans[i + 1][y1 + 1] = ++cur;
            }
        } else if (ok(n - 2, m - 2, k - 1)) {
            self(self, x1 + 1, x2 - 1, y1 + 1, y2 - 1, k - 1);
            for (int i = x1; i < x2; i++) {
                ans[i][y1] = ans[i][y2 - 1] = k;
            }
            for (int i = y1; i < y2; i++) {
                ans[x1][i] = ans[x2 - 1][i] = k;
            }
        }
    };
    rec(rec, 0, N, 0, M, K);
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < M; j++) {
            std::cout << ans[i][j] << " \n"[j == M - 1];
        }
    }
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int T;
    std::cin >> T;
    
    while (T--) {
        solve();
    }
    
    return 0;
}