#include <cstdio>
#include <vector>

using namespace std;

const int N = 2e3 + 50;

int A[N][N], n, m, k;

void solve(int n, int m, int k) {
//	scanf("%d%d%d", &n, &m, &k);
	int kk = k;
	int flip = 0, trans = 0;
	if(k > n * m - k) k = n * m - k, flip = 1;
	if(n > m) swap(n, m), trans = 1;
	for(int i = 0;i < n;i++)
		for(int j = 0;j < m;j++) A[i][j] = 0;
	int ima_free = 0;
	for(int i = 0;i < n;i++)	
		for(int j = 0;j < m;j++)
			if(i % 2 == 0 && j % 2 == 0) ima_free++;
	if(k <= ima_free) {
		for(int i = 0;i < n;i++) {
			for(int j = 0;j < m;j++) {
				if(i % 2 == 0 && j % 2 == 0 && k > 0) {
					A[i][j] = 1; k--;
				} else {
					A[i][j] = 0;
				}
			}
		}
	} else if (n == 2 && m == 2 && k == 2) {
		A[0][0] = 1; A[1][0] = 1;
	} else if (n == 4 && m == 4 && k == 5) {
		A[0][0] = 1; A[1][0] = 1; A[0][1] = 1;
		A[0][3] = 1; A[3][0] = 1;
	} else if (n == 4 && m == 5 && k == 9) {
		A[0][0] = 1; A[1][0] = 1; A[0][1] = 1;
		A[0][2] = 1; A[1][1] = 1; A[2][0] = 1;
		A[3][4] = 1; A[1][4] = 1; A[3][2] = 1;
	} else if (n == 5 && m == 5 && k == 12) {
		A[0][0] = 1; A[1][0] = 1; A[0][1] = 1;
		A[0][2] = 1; A[1][1] = 1; A[2][0] = 1;
		A[0][3] = 1; A[1][2] = 1; A[2][1] = 1; A[3][0] = 1;
		A[2][4] = 1; A[4][2] = 1;
	} else {
		int uzmi = 0;
		while(uzmi * n + (n + 1) / 2 <= k) uzmi++;
		uzmi--;
		for(int j = 0;j < uzmi;j++) {
			for(int i = 0;i < n;i++) A[i][j] = 1;
		}
		for(int i = 0;i < n;i += 2) A[i][uzmi] = 1;
		k -= uzmi * n + (n + 1) / 2;
		for(int j = m - 1;j >= 0;j--)
			for(int i = n - 1;i >= 0;i--)
				if(i % 2 == 0 && j % 2 == (m - 1) % 2 && k > 0) {
					A[i][j] = 1; k -= 1;
				}
	}
	for(int i = 0;i < n;i++)
		for(int j = 0;j < m;j++)
			A[i][j] ^= flip;
	int ans = 0, cnt_jen = 0;
	for(int i = 0;i < n;i++)	
		for(int j = 0;j < m;j++)
			if(A[i][j]) cnt_jen++;
	if(cnt_jen != kk) {
		printf("(%d, %d, %d) : KRIVI BROJ JEDINICA %d != %d\n", n, m, kk, cnt_jen, kk);
		return;
	}
	for(int i = 0;i + 1 < n;i++)
		for(int j = 0;j + 1 < m;j++)
			if(A[i][j] + A[i + 1][j] + A[i][j + 1] + A[i + 1][j + 1] == 2) ans++;
	//printf("ANS = %d\n", ans);
	//if(ans) printf("\n\n\t\t (%d, %d, %d) :  NIJE NULA(%d )\n\n\n", n, m, kk, ans);
	//return;
	if(!trans) {
		for(int i = 0;i < n;i++) {
			for(int j = 0;j < m;j++)
				printf("%d", A[i][j]);
			printf("\n");
		}
	} else {
		for(int j = 0;j < m;j++) {
			for(int i = 0;i < n;i++) {
				printf("%d", A[i][j]);
			}
			printf("\n");
			
		}
	}
}

int main() {
	int T; scanf("%d", &T);
	for(;T--;) {
		int n, m, k; scanf("%d%d%d", &n, &m, &k);
		solve(n, m, k);
	}
	return 0;
}