#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using ll = long long;
using ld = long double;
#define all(s) (s).begin(),(s).end()
#define vcin(n) for(ll i=0;i<ll(n.size());i++) cin>>n[i]
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
#define fi first
#define se second
#define P pair<ll,ll>
//const ll mod = 998244353;
const ll mod = 1000000007;
const ll inf = 2000000000000000000ll;
static const long double pi = 3.141592653589793;
void YesNo(bool a){if(a){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}}
void YESNO(bool a){if(a){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}}
template<class T,class U> void chmax(T& t,const U& u){if(t<u) t=u;}
template<class T,class U> void chmin(T& t,const U& u){if(t>u) t=u;}
ll modPow(ll a, ll n, ll mod) { ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }

int main() {
  /* mod は 1e9+7 */
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(10);
  ll h,w,x;
  cin>>h>>w>>x;
  swap(h,w);
  if(h!=1&&w!=1){
  for(int i=1;i<=9;i++){
    for(int j=1;j<=9;j++){
      for(int k=1;k<=9;k++){
        for(int s=1;s<=9;s++){
          if(i+j+k+s==x){
            vector<vector<ll>> ans(h,vector<ll>(w));
            for(int a=0;a<h;a++){
              for(int b=0;b<w;b++){
                if(b%3==2||a%3==2){
                  continue;
                }
                if(a%3==0&&b%3==0){
                  ans[a][b]=i;
                }
                else if(a%3==1&&b%3==0){
                  ans[a][b]=j;
                }
                else if(a%3==1&&b%3==1){
                  ans[a][b]=k;
                }
                else{
                  ans[a][b]=s;
                }
              }
            }
            for(int a=0;a<h;a++){
              for(int b=0;b<w;b++){
                cout<<ans[a][b];
              }
              cout<<endl;
            }
            return 0;
          }
        }
      }
    }
  }
  cout<<-1<<endl;
  }
  else{
    swap(h,w);
    if(h==1&&w==1){
      if(x<=9){
        cout<<x<<endl;
      }
      else{
        cout<<-1<<endl;
      }
    }
    else{
      if(h==1){
        for(int i=1;i<=9;i++){
         for(int j=1;j<=9;j++){
           if(i+j==x){
           for(int k=0;k<w;k++){
             if(k%3==2){
               cout<<0<<endl;
             }
             else if(k%3==1){
               cout<<i<<endl;
             }
             else{
               cout<<j<<endl;
             }
           }
             return 0;
           }
         }
        }
      }
      if(w==1){
        for(int i=1;i<=9;i++){
         for(int j=1;j<=9;j++){
           if(i+j==x){
           for(int k=0;k<h;k++){
             if(k%3==2){
               cout<<0;
             }
             else if(k%3==1){
               cout<<i;
             }
             else{
               cout<<j;
             }
           }
             cout<<endl;
             return 0;
           }
         }
        }
      }
    }
    cout<<-1<<endl;
  }
}