#include <bits/stdc++.h>

using namespace std;

const int N = 1505;

int a[N][N];

int Solve(int n, int m, int k) {
    if (!k) {
        return 1;
    }
    if (k == n * m) {
        for (int i = 1; i <= n; ++i) {
            for (int j = 1; j <= m; ++j) a[i][j] = 1;
        }
        return 1;
    }
    if (k <= ((n + 1) >> 1) * ((m + 1) >> 1)) {
        for (int i = 1; i <= n; i += 2) {
            for (int j = 1; j <= m; j += 2) {
                if (k) {
                    a[i][j] = 1;
                    --k;
                }
            }
        }
        return 1;
    }
    for (int i = 1; i + 1 < n && i * m + (m >> 1) <= k; ++i) {
        int tk = k - i * m - (m >> 1);
        if ((((n - i - 2) + 1) >> 1) * ((m + 1) >> 1) >= tk) {
            for (int j = 1; j <= i; ++j) {
                for (int k = 1; k <= m; ++k) a[j][k] = 1;
            }
            for (int k = 2; k <= m; k += 2) a[i + 1][k] = 1;
            for (int j = i + 3; j <= n; j += 2) {
                for (int k = 1; k <= m; k += 2) {
                    if (tk) {
                        a[j][k] = 1;
                        --tk;
                    }
                }
            }
            return 1;
        }
    }
    return 0;
}

int solve(int n, int m, int k) {
    if (Solve(n, m, k)) return 1;
    if (Solve(n, m, n * m - k)) {
        for (int i = 1; i <= n; ++i) {
            for (int j = 1; j <= m; ++j) a[i][j] ^= 1;
        }
        return 1;
    }
    return 0;
}

signed main() {
    int T; scanf("%d", &T);
    while (T--) {
        int n, m, k; scanf("%d%d%d", &n, &m, &k);
        if (n == 2 && m == 2 && k == 2) {
            puts("00");
            puts("11");
            continue;
        }
        if (n == 4 && m == 4 && k == 5) {
            puts("1111");
            puts("0100");
            puts("0000");
            puts("0000");
            continue;
        }
        if (n == 4 && m == 4 && k == 11) {
            puts("0000");
            puts("1011");
            puts("1111");
            puts("1111");
            continue;
        }
        for (int i = 1; i <= max(n, m); ++i) {
            for (int j = 1; j <= max(n, m); ++j) a[i][j] = 0;
        }
        if (!solve(n, m, k)) {
            if (solve(m, n, k)) {
                for (int i = 1; i <= max(n, m); ++i) {
                    for (int j = i + 1; j <= max(n, m); ++j) {
                        swap(a[i][j], a[j][i]);
                    }
                }
            } else {
                puts("WA!");
            }
        }
        for (int i = 1; i <= n; ++i) {
            for (int j = 1; j <= m; ++j) {
                printf("%d", a[i][j]);
            }
            puts("");
        }
    }
    return 0;
}