#include <bits/stdc++.h>

void solve() {
  int n, m, k;
  std::cin >> n >> m >> k;
  if (n % 2 != 0 || m % 2 != 0) {
    std::cout << "NO\n";
    return;
  }
  if (n == 2) {
    if (k != n * m / 4) {
      std::cout << "NO\n";
    } else {
      std::cout << "YES\n";
      for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
          std::cout << j / 2 + 1 << ' ';
        }
        std::cout << '\n';
      }
    }
    return;
  }
  int mi = (n - 2) * (m - 2) / 4 + 1;
  int mx = n * m / 4;
  if (k < mi || k == mx - 1) {
    std::cout << "NO\n";
    return;
  }
  std::cout << "YES\n";
  if (k == mx) {
    for (int i = 0; i < n; ++i) {
      for (int j = 0; j < m; ++j) {
        std::cout << 1 + i / 2 + j / 2 * 2 << ' ';
      }
      std::cout << '\n';
    }
    return;
  }
  int bound = 2 * (m / 2 - (k - mi)) - 1;
  int num1 = 1 + (n - 2) * (bound - 1) / 4;
  std::cerr << bound << '\n';
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < m; ++j) {
      if (j <= bound) {
        if (i == 0 || i == n - 1 || j == 0 || j == bound) {
          std::cout << 1 << ' ';
        } else {
          std::cout << 2 + (j - 1) / 2 << ' ';
        }
      } else {
        std::cout << num1 + 1 + (j - bound - 1) / 2 * 2 + i / 2 << ' ';
      }
    }
    std::cout << '\n';
  }
}

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int t;
  std::cin >> t;
  while ((t--) != 0) {
    solve();
  }
}