#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
//#include <atcoder/all>
using ll = long long;
using ld = long double;
#define FOR(i, a, b) for(ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) FOR(i, 0, n)
#define rFOR(i, a, b) for(ll i = (ll)(a - 1); i >= (ll)(b); i--)
#define rrep(i, a) rFOR(i, a, 0)
#define all(c) begin(c),end(c)
using namespace std;
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ld PI = acos(-1);
const ll INF = 1e18;
struct edge{ll to, cost;};

template <typename T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <typename T>
bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int H,W,X;
    cin >> W >> H >> X;
    vvl ans(H,vl(W,-1));
    rep(i,H){
        rep(j,W){
            if(i%3==2||j%3==2||(H-1-i)%3==2||(W-1-j)%3==2) ans[i][j]=0;
        }
    }
    int cnt=0;
    rep(i,min(H,3)){
        rep(j,min(W,3)){
            if(ans[i][j]==-1) cnt++;
        }
    }
    if(cnt*9<X){
        cout << -1 << endl;
        return 0;
    }
    rep(i,min(H,3)){
        rep(j,min(W,3)){
            if(ans[i][j]==-1){
                ans[i][j]=min(9,X);
                X-=ans[i][j];
            }
        }
    }
    rep(i,H){
        rep(j,W){
            ans[i][j]=ans[i%3][j%3];
        }
    }
    rep(i,H){
        rep(j,W){
            cout << ans[i][j];
        }
        cout << endl;
    }
}