#include "bits/stdc++.h"
using namespace std;
#define int long long
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()

const int mxn=2e3;

int n,m,k,fl,nm;
int g[mxn][mxn];

void solve2() {
	if (k%2) {
		for (int i=0; i<m; i++) {
			if (k==0) break;
			g[0][i] = 1; k--; if (k==0) break;
			g[1][i] = 1; k--; if (k==0) break;
		}
	} else {
		if (k==0) return;
		g[0][m-1] = 1; k--;
		for (int i=0; i<m; i++) {
			if (k==0) break;
			g[0][i] = 1; k--; if (k==0) break;
			g[1][i] = 1; k--; if (k==0) break;
		}
	}
}

void solvek2() {
	g[0][0] = g[n-1][m-1] = 1;
}

void solven() {
	int c = 0;
	while (k >= 2*n) {
		for (int i=0; i<n; i++) {
			g[i][c] = 1; k--;
		}
		c++;
	}
	if (k >= n) {
		for (int i=0; i<n; i+=2) {
			g[i][c] = 1; k--;
		}
	}
	if (k==2) {
		g[0][m-1] = g[n-1][m-1] = 1;
	} else {
		int x = k%2;
		for (int i=0; k; i++) {
			g[i][m-1] = 1; k--;
			if (x && i%2==0) {
				g[i][m-2] = 1; k--;
			}
			if (!x && i%2) {
				g[i][m-2] = 1; k--;
			}
		}
	}
}

void solve() {
	cin>>n>>m>>k;
	if (2*k > n*m) {
		fl = 1;
		k = n*m-k;
	} else fl = 0;
	if (n>m) {
		nm = 1;
		swap(n,m);
	} else nm = 0;
	
	for (int i=0; i<n; i++) {
		for (int j=0; j<m; j++) g[i][j]=0;
	}
	
	if (n==2) {
		solve2();
	} else if (k==2) {
		solvek2();
	} else {
		solven();
	}
	
	if (fl) {
		for (int i=0; i<n; i++) {
			for (int j=0; j<m; j++) {
				g[i][j] = 1-g[i][j];
			}
		}
	}
	if (nm) {
		for (int j=0; j<m; j++) {
			for (int i=0; i<n; i++) {
				cout<<g[i][j]<<"";
			}
			cout<<"\n";
		}
	} else {
		for (int i=0; i<n; i++) {
			for (int j=0; j<m; j++) {
				cout<<g[i][j]<<"";
			}
			cout<<"\n";
		}
	}
	cout<<flush;
}

signed main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);
	
	int t; cin>>t;
	while (t--) {
		solve();
	}
	
	return 0;
}