#include <bits/stdc++.h>
#define int long long
#define PB push_back
#define MP make_pair
#define PII pair<int, int>
#define FOR(i, l, r) for (int i = (l); i <= (r); ++i)
#define ROF(i, r, l) for (int i = (r); i >= (l); --i)
#define FI first
#define SE second
#define SZ size()
using namespace std;
const int N = 1.5e3 + 5;
const int mod = 998244353;
const int inf = 1e18;
int n, T, m, k;
bool mp[N][N], flag;
void print() {
    if (!flag) {
        FOR (i, 1, n) {
            FOR (j, 1, m) {
                cout << mp[i][j];
            }
            cout << '\n';
        }
        return;
    }
    FOR (i, 1, m) {
        FOR (j, 1, n) {
            cout << mp[j][i];
        }
        cout << '\n';
    }
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> T;
    while (T --> 0) {
        cin >> n >> m >> k;
        flag = 0;
        if (n < m) {
            swap(n, m);
            flag = 1;
        }
        FOR (i, 1, n) {
            FOR (j, 1, m) {
                mp[i][j] = 0;
            }
        }
        if (!k) {
            print();
            continue;
        }
        if (n == 2 && m == 2 && k == 2) {
            cout << "10\n01\n";
            continue;
        }
        if (!k) {
            print();
            continue;
        }
        mp[1][1] = 1;
        --k;
        if (k == 1) {
            mp[1][3] = 1;
            print();
            continue;
        }
        if (k == 2) {
            mp[2][1] = mp[1][2] = 1;
            print();
            continue;
        }
        FOR (i, 3, n) {
            mp[1][i] = 1;
            --k;
            if (!k) {
                break;
            }
            mp[1][i - 1] = mp[2][i - 1] = 1;
            k -= 2;
            if (k <= 0) {
                break;
            }
            ++i;
        }
        if (k > 0 && n % 2 == 0) {
            mp[1][n] = mp[2][n] = 1;
            k -= 2;
        }
        FOR (i, 2, m) {
            FOR (j, 1, n) {
                if (k <= 0) {
                    break;
                }
                int t = ((j - 1) & 1) + i;
                if (t >= n) {
                    continue;
                }
                k -= 2;
                mp[t][j] = mp[t + 1][j] = 1;
            }
            ++i;
        }
        if (m & 1) {
            FOR (j, 2, n) {
                if (k <= 0) {
                    break;
                }
                --k;
                mp[n][j] = 1;
                j++;
            }
        } else {
            FOR (j, 1, n) {
                if (k <= 0) {
                    break;
                }
                --k;
                mp[n][j] = 1;
                j++;
            }
        }
        if (k == -1) {
            mp[1][1] = 0;
            ++k;
        }
        print();
    }
    return 0;
}