#include using namespace std; #define rep(i, n) for(int i = 0; i < n; i++) #define rep2(i, x, n) for(int i = x; i <= n; i++) #define rep3(i, x, n) for(int i = x; i >= n; i--) #define each(e, v) for(auto &e: v) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define sz(x) (int)x.size() using ll = long long; using pii = pair; using pil = pair; using pli = pair; using pll = pair; const int MOD = 1000000007; //const int MOD = 998244353; const int inf = (1<<30)-1; const ll INF = (1LL<<60)-1; template bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;}; template bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;}; struct io_setup{ io_setup(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed << setprecision(15); } } io_setup; int main(){ int H, W, K; cin >> W >> H >> K; vector S(H, string(W, '0')); vector ux, uy; rep(i, H){ if(i%3 != 2 && (H-1-i)%3 != 2) ux.eb(i); } rep(j, W){ if(j%3 != 2 && (W-1-j)%3 != 2) uy.eb(j); } int dx, dy; if(H < 3) dx = H; else dx = (H%3 == 2? 2 : 1); if(W < 3) dy = W; else dy = (W%3 == 2? 2 : 1); if(K > 9*dx*dy) {cout << "-1\n"; return 0;} vector> c(dx, vector(dy)); rep(i, dx){ rep(j, dy){ c[i][j] = min(K, 9); K -= min(K, 9); } } rep(i, sz(ux)){ rep(j, sz(uy)){ char t = '0'+c[i%dx][j%dy]; S[ux[i]][uy[j]] = t; } } rep(i, H) cout << S[i] << '\n'; }