#include <bits/stdc++.h>
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;

int main() {
	fastio;
	int T;
	cin >> T;
	while(T--) {
		int N, M, K;
		cin >> N >> M >> K;
		bool flip = false;
        bool nm = false;

		if(K * 2 > N * M){
			flip = true;
			K = N * M - K;
		}

		if (M > N){
			swap(N, M);
			nm = true;
		}

		int ans[N][M];
		memset(ans, 0, sizeof(ans));

		for (int i = 0; i < M; i += 2){
            if (K == 0) {
                break;
            }
			ans[0][i] = 1;
			K--;
		}

		for (int i = 1; i < N; i++) {
			if (K == 0 || K == 1) {
					break;
			}
			for (int j = i % 2; j < M; j += 2) {
				if (K == 0 || K == 1) {
					break;
				}
				K -= 2;
				ans[i][j] = 1;
				ans[i - 1][j] = 1;
				
			}
		}

		if (K == 1) {
			ans[N - 1][M - 1] = 1;
		}

		if (!nm) {
			for (int i = 0; i < N; i++) {
				for (int j = 0; j < M; j++) {
					if (flip) {
						cout << (ans[i][j] + 1) % 2;
					}
					else {
						cout << ans[i][j];
					}
				}
				cout << '\n';
			}
		}
		
		else {
			swap(N, M);
			for (int i = 0; i < N; i++) {
				for (int j = 0; j < M; j++) {
					if (flip) {
						cout << (ans[i][j] + 1) % 2;
					}
					else {
						cout << ans[j][i];
					}
				}
				cout << '\n';
			}
		}
	}
}