#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n, m, k;
    cin >> n >> m >> k;
    int f[n][m];
    memset(f, 0, sizeof f);
    if (k < n || k < m) cout << -1 << endl;
    else
    {
        int i, j;
        for (i = 0, j = 0; i < n && j < m; i ++ , j ++ )
        {
            f[i][j] ++ ;
            k -- ;
        }
       while (i < n && k)
       {
           f[i ++ ][j - 1] ++ ;
           k -- ;
       }
        while (j < m && k)
        {
            f[i - 1][j ++ ] ++ ;
            k -- ;
        }
        while (k -- )
        {
            f[i - 1][j - 1] ++ ;
        }

        for (int i = 0; i < n; i ++ )
        {
            for (int j = 0; j < m; j ++ )
            {
                cout << f[i][j] << ' ';
            }
            cout << endl;
        }
    }

    return 0;
}