#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

constexpr ll mod=1e9+7;

ll mod_pow(ll x,ll n){
	x%=mod;
	ll res=1;
	while(n>0){
		if(n&1LL)res=res*x%mod;
		x=x*x%mod; n>>=1LL;
	}
	return res;
}

void solve(int h,int w,int k){
	if(h==1){
		if(w==1){
			if(k<=9) printf("9\n");
			else printf("-1\n");
			return;
		}
		if(k<=18 and w%3==2){
			for(int i=0;i<w;i++){
				if(i%3==0)printf("%d",min(k,9));
				else if(i%3==1)printf("%d",k-min(k,9));
				else printf("0");
			}
			printf("\n");
			return;
		}
		printf("-1\n");
		return;
	}
	if(w==1){
		if(k<=18 and h%3==2){
			for(int i=0;i<h;i++){
				if(i%3==0)printf("%d\n",min(k,9));
				else if(i%3==1)printf("%d\n",k-min(k,9));
				else printf("0\n");
			}
			return;
		}
		return;
	}
	assert(0);
}

int main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	int h,w,k; cin >> w >> h >> k;
	solve(h,w,k);
}