#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=1500;
#define rep(i, a, b) for(ll i=a;i<=b;i++)
ll t, a[N][N];
void solve(ll n, ll m, ll k){
    rep(i, 1, n){
        rep(j, 1, m){
            a[i][j]=0;
        }
    }
    if(k==0)return;

    for(ll i=1;i<=m;i+=2){
        a[1][i]=1;
        k--;
        if(k==0)return;
    }
    ll j=1;
    while(k>=m){
        j++;
        for(ll i=1;i<=m;i+=2){
            a[j][i]=1;
        }
        for(ll i=2;i<=m;i+=2){
            a[j-1][i]=1;
        }
        k-=m;
    }
    if(k){
        for(ll i=1;i<=m;i+=2){
            a[n][i]=1;
            k--;
            if(k==0)return;
        }
        for(ll i=2;i<=m;i+=2){
            a[n][i]=1;
            a[n-1][i]=1;
            k-=2;
            if(k==0)return;
            if(k==-1){
                a[1][1]=0;
                return;
            }
        }
    }
}
int main(){
    ios::sync_with_stdio(false);
    cin >> t;
    while(t--){
        ll n, m, k;
        cin >> n >> m >> k;
        bool c1=0, c2=0;
        if(k>n*m/2){
            k=n*m-k;
            c1=1;
        }
        if(n<m){swap(n, m);c2=1;}
        solve(n, m, k);
        if(c2==0){
            rep(i, 1, n){
                rep(j, 1, m){
                    cout << (a[i][j]^c1);
                }
                cout << endl;
            }
        }else{
            rep(i, 1, m){
                rep(j, 1, n){
                    cout << (a[j][i]^c1);
                }
                cout << endl;
            }
        }
        

    }
    return 0;
}