#include <iostream>
#include <stdio.h>
#include <vector>
#include <map>
#include <utility>
#include <list>
#include <algorithm>
#include <bitset>
typedef long long ll;
const ll INF=20000;
using namespace std;
ll dx[]={-1,0,-1};
ll dy[]={-1,-1,0};
int main(){
        ll h,w;
        cin>>w>>h;
        ll x;
        cin>>x;
    //    vector<vector<ll>> ans(h,vector<ll>(w,0));
       for(ll z=1;z<=9;z++){ 
       vector<vector<ll>> ans(h,vector<ll>(w,0));
        ans[0][0]=z;
        for(ll i=0;i<h;i++)
        {
            for(ll j=0;j<w;j++)
            {
                ll ansb=0;
                for(ll k=0;k<3;k++)
                {
                    ll x=i+dx[k];
                    ll y=j+dy[k];
                    if(i==0&&j==0)break;
                    if(0<=x&&0<=y&&x<=h-1&&y<=w-1)ansb+=ans[x][y];
                }
                if(i==0&&j==0)break;
                if(ansb==x)
                {
                   // ans[i][j]=0;
                    for(ll i=0;i<h;i++)
                      {
                              for(ll j=0;j<w;j++)
                              {
                                  cout<<ans[i][j];
                              }
                            cout<<endl;
                      }
                      return 0;
                }
                
                ans[i][j]=ansb;

            }
        }
       }
    cout<<"-1"<<endl;
        
    return 0;
}