#include <algorithm>
#include <iostream>
#include <vector>


bool IsPossible(int height, int length, int num_area) {
    if (height%2 == 1 || length%2 == 1) {
        return false;
    }
    if (num_area > height * length / 4) {
        return false;
    }
    if (num_area < std::max(height, length) / 2) {
        return false;
    }
    if (num_area == height * length / 4 - 1) {
        return false;
    }
    if (height == length && num_area == height / 2 + 1) {
        return false;
    }
    return true;
}


void Solve(std::vector<std::vector<int>>& field, int height, int length, int num_area, int height_offset, int length_offset) {
    // full outline
    if (num_area == 0) {
        return;
    }
    if (IsPossible(height-2, length-2, num_area-1)) {
        for (int i = 0; i < height; i++) {
            field[height_offset+i][length_offset] = num_area;
            field[height_offset+i][length_offset+length-1] = num_area;
        }
        for (int i = 0; i < length; i++) {
            field[height_offset][length_offset+i] = num_area;
            field[height_offset+height-1][length_offset+i] = num_area;
        }
        Solve(field, height-2, length-2, num_area-1, height_offset+1, length_offset+1);
    }
    // reduce top
    else if (IsPossible(height-2, length, num_area - length/2)) {
        for (int i = 0; i < length/2; i++) {
            field[height_offset][length_offset+2*i] = num_area-i;
            field[height_offset+1][length_offset+2*i] = num_area-i;
            field[height_offset][length_offset+2*i+1] = num_area-i;
            field[height_offset+1][length_offset+2*i+1] = num_area-i;
        }
        Solve(field, height-2, length, num_area-length/2, height_offset+2, length_offset);
    }
    // reduce left
    else if (IsPossible(height, length-2, num_area - height/2)) {
        for (int i = 0; i < height/2; i++) {
            field[height_offset+2*i][length_offset] = num_area-i;
            field[height_offset+2*i+1][length_offset] = num_area-i;
            field[height_offset+2*i][length_offset+1] = num_area-i;
            field[height_offset+2*i+1][length_offset+1] = num_area-i;
        }
        Solve(field, height, length-2, num_area-height/2, height_offset, length_offset+2);
    }
    else {
        std::cout << "ERROR\n";
    }
}


int main() {
    int num_testcases;
    std::cin >> num_testcases;
    for (int i = 0; i < num_testcases; i++) {
        int height;
        int length;
        int num_area;
        std::cin >> height >> length >> num_area;
        if (!IsPossible(height, length, num_area)) {
            std::cout << "NO\n";
            continue;
        }
        std::cout << "YES\n";
        std::vector<std::vector<int>> field(height, std::vector<int>(length, 0));
        Solve(field, height, length, num_area, 0, 0);
        for (std::vector<int>& row : field) {
            for (int& dot : row) {
                std::cout << dot << " ";
            }
            std::cout << "\n";
        }
    }
}