#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <string>
#include <map>
#include <queue>

using namespace std;

signed main()
{
    int n, m, k;
    cin >> n >> m >> k;
    vector<vector<int>> v(m, vector<int>(m));
    int q = k;
    int id = 0;
    while(q != 0)
    {
        for(int i = 0; i < m && q > 0; ++i)
        {
            if(v[i][(i + id) % m] == 1)
            {
                q++;
            }
            v[i][(i + id) % m] = 1;
            q--;
        }
        id++;
    }
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < n; j++)
        {
            int st = i % m;
            int sq = j % m;
            cout << v[st][sq];
        }
        cout << endl;
    }
}