#include<iostream>
#include<cstdio>
#define N 200000
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum; 
}
int n,m,k,length,d[N+1],ans;
int F(int x,int y)
{
	return (x-1)*m+y;
}
void solve(int X1,int X2,int Y1,int Y2,int x)
{
	if (X1>X2||Y1>Y2) return;
	if (x<=(((X2-X1+1-2)*(Y2-Y1+1-2))>>2)+1&&x!=(((X2-X1+1-2)*(Y2-Y1+1-2))>>2))
	{
		++length;
		for (int i=X1;i<=X2;++i) d[F(i,Y1)]=d[F(i,Y2)]=length;
		for (int i=Y1;i<=Y2;++i) d[F(X1,i)]=d[F(X2,i)]=length;
		solve(X1+1,X2-1,Y1+1,Y2-1,x-1);
	}
	else if (X2-X1+1>=Y2-Y1+1)
	{
		for (int i=Y1;i<=Y2;i+=2) ++length,d[F(X1,i)]=d[F(X1+1,i)]=d[F(X1,i+1)]=d[F(X1+1,i+1)]=length;
		solve(X1+2,X2,Y1,Y2,x-((Y2-Y1+1)>>1));
	}
	else
	{
		for (int i=X1;i<=X2;i+=2) ++length,d[F(i,Y1)]=d[F(i,Y1+1)]=d[F(i+1,Y1)]=d[F(i+1,Y1+1)]=length;
		solve(X1,X2,Y1+2,Y2,x-((X2-X1+1)>>1));
	}
	return;
}
int main()
{
	int T=read();
	while (T--)
	{
		n=read(),m=read(),k=read(),length=ans=0;
		if ((n&1)||(m&1)||k<(max(n,m)>>1)||k>((n*m)>>2)||k==(((n*m)>>2)-1))
		{
			puts("NO");
			continue;
		}
		solve(1,n,1,m,k);
		for (int i=1;i<=n;++i)
			for (int j=1;j<=m;++j)
				ans=max(ans,d[F(i,j)]);
		if (ans!=k) puts("NO");
		else
		{
			puts("YES");
			for (int i=1;i<=n;++i)
			{
				for (int j=1;j<=m;++j) printf("%d ",d[F(i,j)]);
				puts("");
			}
		}
	}
	return 0;
}