#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cstdint>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
#define MP make_pair
#define PB push_back
#define inf 1000000007
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()

template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
    std::fill( (T*)array, (T*)(array+N), val );
}
 
template<class T> inline bool chmax(T &a, T b){
    if(a<b){
        a = b;
        return true;
    }
    return false;
}

template<class T> inline bool chmin(T &a, T b){
    if(a>b){
        a = b;
        return true;
    }
    return false;
}
int a[2][2];
int main(){
    int n,m,x;
    cin >> n>> m >> x;
    if(x>=37){
        cout << -1 << endl;
        return 0;
    }
    rep(i,2){
        rep(j,2){
            if(x>=9){
                a[i][j] = 9;
                x-=9;
            }else{
                a[i][j] = x;
                x-=x;
            }
        }
    }
    rep(i,n){
        rep(j,m){
            if(i%3==2||j%3==2){
                cout << 0;
            }else{
                int b = (i%3);
                int c = (j%3);
                cout << a[b][c];
            }
        }
        cout << "\n";
    }
    return 0;
}