#include<bits/stdc++.h>
using namespace std;
int t,n,m,k;
const int N=1505;
int a[N][N];
void solve()
{
    scanf("%d%d%d",&n,&m,&k);
    int inv=0,trp=0;
    if (k>n*m/2)
    {
        k=n*m-k;
        inv=1;
    }
    if (n>m)
    {
        swap(n,m);
        trp=1;
    }
    for (int i=1;i<=n;++i)
        for (int j=1;j<=m;++j)
            a[i][j]=0;
    if (k<n+(n+1)/2)
    {
        for (int i=1;i<=n;i+=2)
            for (int j=1;j<=m;j+=2)
                if (k)
                {
                    --k;
                    a[i][j]=1;
                }
        for (int i=1;i<=n;++i)
            for (int j=1;j<=m;++j)
                if (k&&a[i][j]==0)
                {
                    --k;
                    a[i][j]=1;
                }
    }
    else
    {
        for (int i=2;i<=m;++i)
            if (i*n+(n+1)/2>k)
            {
                for (int j=1;j<=n;++j)
                    for (int l=1;l<i;++l)
                        a[j][l]=1;
                for (int j=1;j<=n;j+=2)
                    a[j][i]=1;
                k-=(i-1)*n+(n+1)/2;
                for (int l=m;l>i;l-=2)
                    for (int j=1;j<=n;j+=2)
                        if (k)
                        {
                            --k;
                            a[j][l]=1;
                        }
            }
    }
    if (inv)
    {
        for (int i=1;i<=n;++i)
            for (int j=1;j<=m;++j)
                a[i][j]=!a[i][j];
    }
    if (trp)
    {
        for (int i=1;i<=m;++i)
        {
            for (int j=1;j<=n;++j)
                printf("%d",a[j][i]);
            puts("");
        }
    }
    else
    {
        for (int i=1;i<=n;++i)
        {
            for (int j=1;j<=m;++j)
                printf("%d",a[i][j]);
            puts("");
        }
    }
}
int main()
{
    // for (int i=2;i<=8;++i)
    //     for (int j=i;j<=8;++j)
    //         for (int k=0;k<=i*j;++k)
    //             prework(i,j,k,prea[i][j][k]);
    scanf("%d",&t);
    while (t--)
        solve();
    return 0;
}