#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define int ll
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using pii = pair<int, int>;
using vi = vector<int>;
#define fi first
#define se second
#define pb push_back

int sz[3030];
int sm[3030];
bool can[1550*1550];

bool solve(int n, int m, int k, bool alr = false)
{
    if (n==2 && m==2 && k == 2)
    {
        cout<<"00\n";
        cout<<"11\n";
        return false;
    }

    int N = 0;
    for (int s=0; s<=n-1+m-1; s++)
    {
        int cur = 0;
        for (int i=0; i<n; i++)
        {
            int j = s-i;
            if (j>=0 && j<m)
                cur++;
        }
        N++;
        sz[N] = cur;
    }

    sm[0] = 0;
    for (int i=1; i<=N; i++)
        sm[i] = sm[i-1] + sz[i];


    for (int l=1; l<=N; l++)
        for (int r=l+1; r<=N; r++)
        {
            if (sm[r] - sm[l-1] == k)
            {
                l--;
                r--;
                for (int i=0; i<n; i++, cout<<"\n")
                    for (int j=0; j<m; j++)
                        cout<<(((i+j>=l) && (i+j<=r))^alr);
                return true;
            }
        }
    for (int i=0; i<=n*m; i++)
        can[i] = false;
    int mxl = 1;
    int mxr = 1;
    for (int i=2; i<=N; i++)
    {
        if (sz[i] > sz[mxl])
            mxl = i;
        if (sz[i] >= sz[mxr])
            mxr = i;
    }
    for (int l=1; l<mxl; l++)
        for (int r=l+1; r<mxl; r++)
            can[sm[r] - sm[l-1]] = true;
//    for (int i=1; i<=N; i++)
//        cout<<sz[i]<<" ";
//    cout<<"\n";
//    for (int i=0; i<=n*m; i++)
//        cout<<can[i]<<" ";
//    cout<<"\n";
    for (int l=mxl+2; l<=N; l++)
        for (int r=l+1; r<=N; r++)
            if (k > sm[r] - sm[l-1])
            {
//                cout<<k-(sm[r]-sm[l-1])<<"\n";
                if (can[k-(sm[r]-sm[l-1])])
                {
                    for (int l1=1; l1<mxl; l1++)
                        for (int r1=l1+1; r1<mxl; r1++)
                            if (k-(sm[r]-sm[l-1]) == sm[r1]-sm[l1-1])
                        {
    l--;
    r--;
    l1--;
    r1--;
                    for (int i=0; i<n; i++, cout<<"\n")
                        for (int j=0; j<m; j++)
                            cout<<((((i+j>=l) && (i+j<=r)) || ((i+j>=l1) && (i+j<=r1)))^alr);
                            return true;
                        }
                }
            }

    if (!alr)
        return solve(n, m, n*m-k, true);
    else
        return false;
    return true;
}

signed main()
{
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    int t;
    cin>>t;
    while (t--)
    {
        int n, m, k;
        cin>>n>>m>>k;
        solve(n, m, k);
    }
//    for (int n=2; n<=10; n++)
//        for (int m=n; m<=10; m++)
//
//    {
////        cout<<setw(2)<<n<<" "<<setw(2)<<m<<" : ";
//        for (int i=0; i<=n*m-i; i++)
//            if (!solve(n, m, i))
//                cout<<n<<" "<<m<<" "<<i<<endl;
////        cout<<"\n";
//    }

}
/*
2 2 2
4 4 8
5 5 8
5 6 8
5 7 8
*/