#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define rrep(i,n) for(int i = int(n)-1; i >= 0; i--)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back
using namespace std;
using ll = long long;
using Pi = pair<int,int>;
using Pll = pair<ll,ll>;
template<class T> bool chmax(T &a, const T &b) {if(a < b) {a = b; return true;} return false;}
template<class T> bool chmin(T &a, const T &b) {if(b < a) {a = b; return true;} return false;}
int dx[] = {1, 0,-1, 0, 1, 1,-1,-1};
int dy[] = {0, 1, 0,-1, 1,-1, 1,-1};
ll mod = 998244353;
ll MOD = 1000000007;
int inf = 1001001001;
ll INF = 1001001001001001001;
int ans[3][3];
int main() {
    int W,H,X;
    cin >> W >> H >> X;
    rep(i,3) {
        rep(j,3) {
            ans[i][j] = -1;
        }
    }
    ans[2][0] = ans[2][1] = ans[2][2] = ans[0][2] = ans[1][2] = 0;
    if(W%3 == 1) {
        ans[0][1] = ans[1][1] = 0;
    }
    if(H%3 == 1) {
        ans[1][0] = ans[1][1] = 0;
    }
    if(W%3 == 0) {
        ans[0][0] = ans[1][0] = 0;
    }
    if(H%3 == 0) {
        ans[0][0] = ans[0][1] = 0;
    }
    rep(i,3) {
        rep(j,3) {
            if(ans[i][j] == -1) {
                ans[i][j] = min(X,9);
                X -= ans[i][j];
            }
        }
    }
    if(X) {
        cout << -1 << endl;
    }
    else {
        rep(i,H) {
            rep(j,W) {
                cout << ans[i%3][j%3];
            }
            cout << endl;
        }
    }
}