///yl/hs/bx/yl
#include<bits/stdc++.h>
#define fep(i,l,r) for(int i=l;i<=r;++i)
#define feb(i,r,l) for(int i=r;i>=l;--i)
#define For(i,u) for(int i=head[u];i;i=e[i].nxt)
#define LL long long
//#define int long long
#define ld long double
#define pi pair<int,int>
#define mpr make_pair
using namespace std;

const int N = 2e5+5,M = 1e7+7,mod = 998244353;
inline int read() {
   int s=0,w=1; char ch=getchar();
   while(!(ch>='0'&&ch<='9')) {if(ch=='-') w=-1; ch=getchar();}
   while(  ch>='0'&&ch<='9')  {s=(s<<1)+(s<<3)+ch-'0'; ch=getchar();}
   return s*w;
}
inline int Mod(int x) {return x>=mod?x-mod:x;}
inline void addmod(int &x,int y) {x=Mod(x+y);}
inline void chkmax(auto &x,auto y) {x=max(x,y);}
inline void chkmin(auto &x,auto y) {x=min(x,y);}

namespace starrylasky {
	int now; vector<int > a[N];
	
	inline void Solve(int k,int lx,int rx,int ly,int ry) {
		if(lx>rx) return ;
		cerr<<k<<" "<<lx<<" "<<rx<<" "<<ly<<" "<<ry<<" "<<4*(k-2)+2*(rx-lx+1+ry-ly+1)<<" "<<(rx-lx+1)*(ry-ly+1)<<"\n";
    	if((rx-lx+1)*(ry-ly+1)==4*k) {
			for(int nx=lx;nx<rx;nx+=2) for(int ny=ly;ny<ry;ny+=2) {
				++now; fep(k,0,1) fep(p,0,1) a[nx+k][ny+p]=now;
			}
			return ;
		}
    	else if(4*(k-2)+2*(rx-lx+1+ry-ly+1)>=(rx-lx+1)*(ry-ly+1)) fep(i,3,rx-lx+1) {
    		int x=i,y=((rx-lx+1)*(ry-ly+1)-4*(k-2))/2-x;
//    		cerr<<x<<" "<<rx-lx<<" "<<y<<" "<<ry-ly<<"\n";
    		if(x<=rx-lx+1&&y<=ry-ly+1&&!(x&1)&&!(y&1)) {
    			++now;// cerr<<2*(x+y)-4+4*(k-1)<<" "<<(rx-lx+1)*(ry-ly+1)<<"\n";
    			fep(j,ly,ly+y-1) a[lx][j]=a[lx+x-1][j]=now;
    			fep(j,lx,lx+x-1) a[j][ly]=a[j][ly+y-1]=now;
    			for(int nx=lx+1;nx<lx+x-1;nx+=2) for(int ny=ly+1;ny<ly+y-1;ny+=2) {
    				++now; fep(k,0,1) fep(p,0,1) a[nx+k][ny+p]=now;
				}
				for(int nx=lx+x;nx<rx;nx+=2) for(int ny=ly;ny<ly+y-1;ny+=2) {
					++now; fep(k,0,1) fep(p,0,1) a[nx+k][ny+p]=now;
				}
				for(int nx=lx;nx<rx;nx+=2) for(int ny=ly+y;ny<ry;ny+=2) {
					++now; fep(k,0,1) fep(p,0,1) a[nx+k][ny+p]=now;
				}
				return ; 
			}
		}
		++now;
		fep(i,lx,rx) a[i][ly]=a[i][ry]=now;
		fep(i,ly,ry) a[lx][i]=a[rx][i]=now;
		Solve(k-1,lx+1,rx-1,ly+1,ry-1);
	}
    inline void Main() {
    	int n=read(),m=read(),k=read(); now=0;
    	if((n&1)||(m&1)) return cout<<"NO\n",void();
    	if(k>n*m/4||k==n*m/4-1||k<max(n,m)/2||k==max(n,m)/2+1) return cout<<"NO\n",void();
    	fep(i,1,n) a[i].resize(m+5);
		Solve(k,1,n,1,m); cout<<"YES\n"; //cerr<<now<<" "<<k<<"\n";
		fep(i,1,n) fep(j,1,m) cout<<a[i][j]<<" \n"[j==m];
    	fep(i,1,n) vector<int > ().swap(a[i]);
	}
}

signed main() {
//	freopen("3.in","r",stdin);
//	freopen("QwQ.out","w",stdout);
    ios::sync_with_stdio(false);
    int _T=read();
    while(_T--) starrylasky::Main();
    return 0;
}