#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
Normie's Template v2.5
Changes:
Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;
//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))
// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
a=(a<b)?a:b;
}
template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
a=(a>b)?a:b;
}
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;
// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
if (!x) return 1;
ll res=BOW(a,x/2,p);
res*=res;
res%=p;
if (x%2) res*=a;
return res%p;
}
ll INV(ll a, ll p)
{
return BOW(a,p-2,p);
}
//---------END-------//
#endif
ll case889[8][8]= {
{6,6,6,6,6,6,6,6},
{6,7,7,8,8,9,9,6},
{6,7,7,8,8,9,9,6},
{6,6,6,6,6,6,6,6},
{1,1,1,1,1,1,4,4},
{1,2,2,3,3,1,4,4},
{1,2,2,3,3,1,5,5},
{1,1,1,1,1,1,5,5},
};
ll case8811[8][8]={
{6,6,6,6,8,8,11,11},
{6,7,7,6,8,8,11,11},
{6,7,7,6,9,9,10,10},
{6,6,6,6,9,9,10,10},
{1,1,1,1,1,1,4,4},
{1,2,2,3,3,1,4,4},
{1,2,2,3,3,1,5,5},
{1,1,1,1,1,1,5,5},
};
vector<vector<ll>> res;
ll n,m,i,j,k,t,t1,u,v,a,b;
void solveh(int xl, int xr, int yl, int yr, int x) {
// cout<<"solve "<<xl<<' '<<xr<<' '<<yl<<' '<<yr<<' '<<x<<endl;
int n,m,i,j,k,t,t1,u,v,a,b;
n=xr-xl;
m=yr-yl;
if (n==8 && m==8 && x==9) {
for (i=0;i<n;i++) for (j=0;j<m;j++) res[i+xl][j+yl]=case889[i][j];
}
else if (n==8 && m==8 && x==11) {
for (i=0;i<n;i++) for (j=0;j<m;j++) res[i+xl][j+yl]=case8811[i][j];
}
else if (n>6) {
if (x>((n-2)/2)*((m-2)/2)+1 || x==((n-2)/2)*((m-2)/2)) {
// cout<<"fuck\n";
for (i=xl+2;i<xr;i+=2) {
res[i][yl]=res[i][yl+1]=res[i+1][yl]=res[i+1][yl+1]=x;
x--;
}
for (i=yl+2;i<yr;i+=2) {
res[xl][i]=res[xl+1][i]=res[xl][i+1]=res[xl+1][i+1]=x;
x--;
}
res[xl][yl]=res[xl+1][yl]=res[xl][yl+1]=res[xl+1][yl+1]=x;
x--;
solveh(xl+2,xr,yl+2,yr,x);
}
else {
for (i=xl;i<xr;i++) res[i][yl]=res[i][yr-1]=x;
for (i=yl;i<yr;i++) res[xl][i]=res[xr-1][i]=x;
solveh(xl+1,xr-1,yl+1,yr-1,x-1);
}
}
else if (n==2) {
for (i=yl;i<yr;i+=2) {
res[xl][i]=res[xl+1][i]=res[xl][i+1]=res[xl+1][i+1]=x;
x--;
}
}
else if (n==4) {
u=(n/2)*(m/2)-x;
u*=2;
if (u) {
for (i=yl;i<yl+u;i++) {
res[xl][i]=res[xl+3][i]=x;
}
res[xl+1][yl]=res[xl+2][yl]=x;
res[xl+1][yl+u-1]=res[xl+2][yl+u-1]=x;
x--;
}
for (i=yl+1;i<yl+u-1;i+=2) {
res[xl+2][i]=res[xl+1][i]=res[xl+2][i+1]=res[xl+1][i+1]=x;
x--;
}
for (i=yl+u;i<yr;i+=2) {
res[xl][i]=res[xl+1][i]=res[xl][i+1]=res[xl+1][i+1]=x;
x--;
res[xl+2][i]=res[xl+3][i]=res[xl+2][i+1]=res[xl+3][i+1]=x;
x--;
}
}
else if (n==6) {
if (x==m) {
for (i=yl;i<yr;i++) {
res[xl][i]=res[xl+3][i]=x;
}
res[xl+1][yl]=res[xl+2][yl]=x;
res[xl+1][yr-1]=res[xl+2][yr-1]=x;
x--;
// cout<<"p1\n";
for (i=yl+1;i<yr-1;i+=2) {
res[xl+2][i]=res[xl+1][i]=res[xl+2][i+1]=res[xl+1][i+1]=x;
x--;
}
// cout<<"p2\n";
for (i=yl;i<yr;i+=2) {
res[xl+4][i]=res[xl+5][i]=res[xl+4][i+1]=res[xl+5][i+1]=x;
x--;
}
// cout<<"p3\n";
}
else if (x==m-2) {
res[xl][yr-4]=res[xl][yr-3]=res[xl][yr-2]=res[xl][yr-1]=x;
res[xl+5][yr-4]=res[xl+5][yr-3]=res[xl+5][yr-2]=res[xl+5][yr-1]=x;
res[xl+1][yr-4]=res[xl+2][yr-4]=res[xl+3][yr-4]=res[xl+4][yr-4]=x;
res[xl+1][yr-1]=res[xl+2][yr-1]=res[xl+3][yr-1]=res[xl+4][yr-1]=x;
x--;
res[xl+1][yr-3]=res[xl+1][yr-2]=res[xl+2][yr-3]=res[xl+2][yr-2]=x;
x--;
res[xl+3][yr-3]=res[xl+3][yr-2]=res[xl+4][yr-3]=res[xl+4][yr-2]=x;
x--;
for (i=xl;i<xr;i++) for (j=yl;j<yr-4;j++) res[i][j]=x;
x--;
for (i=yl+1;i<yr-5;i+=2) {
res[xl+1][i]=res[xl+2][i]=res[xl+1][i+1]=res[xl+2][i+1]=x;
x--;
}
for (i=yl+4;i<yr-5;i+=2) {
res[xl+4][i]=res[xl+5][i]=res[xl+4][i+1]=res[xl+5][i+1]=x;
x--;
}
res[xl+3][yl+1]=res[xl+4][yl+1]=res[xl+3][yl+2]=res[xl+4][yl+2]=x;
x--;
}
else if (x>m) {
for (i=xl+2;i<xr;i+=2) {
res[i][yl]=res[i][yl+1]=res[i+1][yl]=res[i+1][yl+1]=x;
x--;
}
for (i=yl+2;i<yr;i+=2) {
res[xl][i]=res[xl+1][i]=res[xl][i+1]=res[xl+1][i+1]=x;
x--;
}
res[xl][yl]=res[xl+1][yl]=res[xl][yl+1]=res[xl+1][yl+1]=x;
x--;
solveh(xl+2,xr,yl+2,yr,x);
}
else {
for (i=xl;i<xr;i++) res[i][yl]=res[i][yr-1]=x;
for (i=yl;i<yr;i++) res[xl][i]=res[xr-1][i]=x;
solveh(xl+1,xr-1,yl+1,yr-1,x-1);
}
}
// cout<<"end solve "<<xl<<' '<<xr<<' '<<yl<<' '<<yr<<' '<<x<<endl;
}
int main()
{
fio;
cin>>t;
for (t1=0;t1<t;t1++) {
cin>>n>>m>>k;
if (n&1 || m&1) {
cout<<"NO\n";
continue;
}
if (k>(n/2)*(m/2) || k<max(n,m)/2) {
cout<<"NO\n";
continue;
}
if (k==(n/2)*(m/2)-1) {
cout<<"NO\n";
continue;
}
if (n==m && k==n/2+1) {
cout<<"NO\n";
continue;
}
cout<<"YES\n";
res.clear();
for (i=0;i<min(n,m);i++) {
res.push_back({});
for (j=0;j<max(n,m);j++) {
res[i].push_back(0);
}
}
solveh(0,min(n,m),0,max(n,m),k);
if (n<=m) {
for (i=0;i<n;i++) for (j=0;j<m;j++) {
cout<<res[i][j]<<' ';
if (j==m-1) cout<<endl;
}
}
else {
for (i=0;i<n;i++) for (j=0;j<m;j++) {
cout<<res[j][i]<<' ';
if (j==m-1) cout<<endl;
}
// cout<<"done\n";
}
}
}
