#include <bits/stdc++.h>

#define LL long long
#define ull unsigned long long
#define F(i, j, k) for (int i = j; i <= k; ++i)
#define DF(i, j, k) for (int i = j; i >= k; --i)

using namespace std;

template <typename T> inline void read(T &n) {
    T w = 1;
    n = 0;
    char ch = getchar();
    while (!isdigit(ch) && ch != EOF) {
        if (ch == '-') w = -1;
        ch = getchar();
    }
    while (isdigit(ch) && ch != EOF) {
        n = (n << 3) + (n << 1) + (ch & 15);
        ch = getchar();
    }
    n *= w;
}

template <typename T> inline void write(T x) {
    T l = 0;
    ull y = 0;
    if (!x) { putchar(48); return; }
    if (x < 0) { x = -x; putchar('-'); }
    while (x) { y = y * 10 + x % 10; x /= 10; ++l; }
    while (l) { putchar(y % 10 + 48); y /= 10; --l; }
}

template <typename T> inline void writes(T x) {
    write(x);
    putchar(' ');
}

template <typename T> inline void writeln(T x) {
    write(x);
    puts("");
}

template <typename T> inline void checkmax(T &a, T b) { a = a > b ? a : b; }

template <typename T> inline void checkmin(T &a, T b) { a = a < b ? a : b; }

int n, m, K, f[1501], ans[1501][1501], now;

inline void out() {
    if (now > K) ans[1][1] = 0;
    F(i, 1, n) {
        F(j, 1, m)
            putchar(ans[i][j] + 48);
        puts("");
    }
}

inline void solve() {
    read(n); read(m); read(K);
    now = 0;
    for (int i = 1; i <= n; i ++) f[i] = 0;
    F(i, 1, n)
        F(j, 1, m)
            ans[i][j] = 0;
    if (K == 0) {
        out();
        return;
    }
    if (K == 1) {
        ans[1][1] = 1;
        out();
        return;
    }
    if (K == 2) {
        if (n > 2)
            ans[1][1] = ans[3][1] = 1;
        else
            if (m > 2)
                ans[1][1] = ans[1][3] = 1;
            else
                ans[1][1] = ans[1][2] = 1;
        out();
        return;
    }
    if (K == 3) {
        ans[1][1] = ans[1][2] = ans[2][1] = 1;
        out();
        return;
    }
    for (int i = 1; i <= n; i += 2) {
        ans[i][1] = f[i] = 1;
        ++ now;
        if (now >= K) {
            out();
            return;
        }
        for (int j = i - 1; j >= 1; j --) {
            if (f[j] == m) continue;
            if (f[j] + 2 > m) {
                ans[j][m] = 1;
                f[j] = m;
                ++ now;
                if (now >= K) {
                    out();
                    return;
                }
            }
            else {
                ans[j][f[j] + 1] = ans[j][f[j] + 2] = 1;
                f[j] += 2;
                now += 2;
                if (now >= K) {
                    out();
                    return;
                }
            }
        }
    }
    while (1) {
        for (int j = n; j >= 1; j --) {
            if (f[j] == m) continue;
            if (f[j] + 2 > m) {
                ans[j][m] = 1;
                f[j] = m;
                ++ now;
                if (now >= K) {
                    out();
                    return;
                }
            }
            else {
                ans[j][f[j] + 1] = ans[j][f[j] + 2] = 1;
                f[j] += 2;
                now += 2;
                if (now >= K) {
                    out();
                    return;
                }
            }
        }
    }
}

int main() {
    //freopen(".in", "r", stdin);
    //freopen(".out", "w", stdout);
    int t;
    read(t);
    while (t--) solve();
    return 0;
}