#include <bits/stdc++.h>
using namespace std;

const int N = 2010;
int T, n, m, k, fl1 = 0, fl2 = 0, a[N][N];
int row;

void Solve(){
	cin >> n >> m >> k;
	
	fl1 = fl2 = 0;
	if (n < m){
		swap(n, m);
		fl1 = 1;
	}
	if (k > ((n * m) >> 1)){
		k = n * m - k;
		fl2 = 1;
	}
	
	for (int i = 1; i <= m; i += 2){
		if (!k)
			break;
		
		a[1][i] = 1;
		k--;
	}
	
	for (int i = 2; i <= n; i++){
		if (k < m)
			break;
		
		for (int j = 1; j <= m; j += 2)
			a[i][j] = 1;
		
		for (int j = 2; j <= m; j += 2)
			a[i - 1][j] = 1;
		
		k -= m;
		row = i;
	}
	
	for (int i = 2; i <= m; i += 2){
		if (k < 2)
			break;
		
		a[row][i] = 1;
		a[row + 1][i] = 1;
		
		k -= 2;
	}
	
	a[n][m] = k;
	
	for (int i = 1; i <= (fl1 ? m : n); i++){
		for (int j = 1; j <= (fl1 ? n : m); j++)
			cout << ((fl1 ? a[j][i] : a[i][j]) ^ fl2) ;
		cout << endl;
	}
	
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
			a[i][j] = 0;
}

signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	cin >> T;
	
	while (T--)
		Solve();
	
	return 0;
}