#include<bits/stdc++.h>
using namespace std;
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define mod 998244353
#define ll long long
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
inline int read()
{
	char ch=getchar(); int nega=1; while(!isdigit(ch)) {if(ch=='-') nega=-1; ch=getchar();}
	int ans=0; while(isdigit(ch)) {ans=ans*10+ch-48;ch=getchar();}
	if(nega==-1) return -ans;
	return ans;
}
void print(vector<int> x){for(int i=0;i<(int)x.size();i++) printf("%d%c",x[i]," \n"[i==(int)x.size()-1]);}
#define N 1505
int ans[N][N],tmp[N][N],n,m,k,op,op2;
void work()
{
	n=read(),m=read(),k=read();
	for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) ans[i][j]=0;
	op=op2=0;
	if(k>n*m/2) op=1,k=n*m-k;
	if(n==2&&m==2)
	{
		for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) if(k) ans[i][j]=1,k--;
	}
	else
	{
		if(m<n) swap(n,m),op2=1;
		int rst=(n+1)/2;
		if(k<=rst)
		{
			for(int i=1;i<=n;i+=2) if(k) ans[i][1]=1,k--;
		}
		else
		{
			int wl=(k-rst)/n;
			for(int j=1;j<=wl;j++) for(int i=1;i<=n;i++) ans[i][j]=1,k--;
			for(int i=1;i<=n;i+=2) ans[i][wl+1]=1,k--;
			
			for(int i=1;i<=n;i+=2) if(k) ans[i][m]=1,k--;
			for(int i=1;i<=n;i+=2) if(k) ans[i][m-2]=1,k--;
		}
		if(op2)
		{
			for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) tmp[i][j]=ans[i][j];
			for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) ans[j][i]=tmp[i][j];
			swap(n,m);
		}
	}
	if(op)
	{
		for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) ans[i][j]^=1;
	}
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++) printf("%d",ans[i][j]);
		printf("\n");
	}
}
signed main()
{
	int T=read(); while(T--) work();
	return 0;
}