#include<bits/stdc++.h>
#define fo(i,a,b) for(int i=a;i<=b;++i)
#define fd(i,a,b) for(int i=a;i>=b;--i)
using namespace std;
const int N=2e5+10;
int T,n,m,k,cnt;
int tmp[N<<1],*it=tmp,*f[N];
bool check(int n,int m,int k){
	if((n&1) || (m&1))return 0;
	if(k>(long long)n*m/4 || k==(long long)n*m/4-1)return 0;
	if(k<max(n,m)/2)return 0;
	if(n==m && k==n/2+1)return 0;
	return 1;
}
void solve(int x,int y,int X,int Y,int k){
	int n=X-x+1,m=Y-y+1;
	if(!n || !m)return;
	if(check(n-2,m-2,k-1)){
		++cnt;
		fo(i,x,X)f[i][y]=f[i][Y]=cnt;
		fo(i,y,Y)f[x][i]=f[X][i]=cnt;
		solve(x+1,y+1,X-1,Y-1,k-1);
		return;
	}
	if(check(n-2,m,k-m/2)){
		for(int i=y;i<=Y;i+=2)
			f[X][i]=f[X-1][i]=f[X][i+1]=f[X-1][i+1]=++cnt;
		solve(x,y,X-2,Y,k-m/2);
		return;
	}
	if(check(n,m-2,k-n/2)){
		for(int i=x;i<=X;i+=2)
			f[i][Y]=f[i][Y-1]=f[i+1][Y]=f[i+1][Y-1]=++cnt;
		solve(x,y,X,Y-2,k-n/2);
		return;
	}
	if(check(n-2,m-2,k-n/2-m/2+1)){
		for(int i=x;i<=X;i+=2)
			f[i][Y]=f[i][Y-1]=f[i+1][Y]=f[i+1][Y-1]=++cnt;
		for(int i=y;i<=Y-2;i+=2)
			f[X][i]=f[X-1][i]=f[X][i+1]=f[X-1][i+1]=++cnt;
		solve(x,y,X-2,Y-2,k-n/2-m/2+1);
	}
}
int main(){
	scanf("%d",&T);
	while(T--){
		scanf("%d%d%d",&n,&m,&k);
		if(!check(n,m,k)){
			printf("NO\n");
			continue;
		}
		printf("YES\n");
		it=tmp;
		fo(i,1,n)f[i]=it,it+=m+2;
		cnt=0;
		solve(1,1,n,m,k);
		fo(i,1,n){
			fo(j,1,m)printf("%d ",f[i][j]);
			printf("\n");
		}
	}

	return 0;
}