#include <bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//#include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define repl(i, a) for (ll i = (ll)0; i < (ll)a; ++i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
#define fi first
#define se second
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll mod_998244353 = 998244353;
constexpr ll INF = 1LL << 60;

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

//using lll=boost::multiprecision::cpp_int;
//using Double=boost::multiprecision::number<boost::multiprecision::cpp_dec_float<1024>>;//仮数部が1024桁
template <class T>
inline bool chmin(T &a, T b)
{
	if (a > b)
	{
		a = b;
		return true;
	}
	return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
	if (a < b)
	{
		a = b;
		return true;
	}
	return false;
}

template <typename T>
T mypow(T x, T n, const T &p = -1)
{ //x^nをmodで割った余り

	if (p != -1)
	{
		x %= p;
	}
	T ret = 1;
	while (n > 0)
	{
		if (n & 1)
		{
			if (p != -1)
				ret = (ret * x) % p;
			else
				ret *= x;
		}
		if (p != -1)
			x = (x * x) % p;
		else
			x *= x;
		n >>= 1;
	}
	return ret;
}

using namespace std;
//using namespace atcoder;

void solve()
{	
	int w,h,x;
	cin>>w>>h>>x;
	auto write=[](const vector<vector<int>> &a)->void{
		int h=a.size(),w=a[0].size();
		rep(i,h){
			rep(j,w)cout<<a[i][j];
			cout<<"\n";
		}
	};
	vector<vector<int>>ans(h,vector<int>(w));
	if(!x){
		write(ans);
	}
	else if(h%3==0||w%3==0){
		if(x>18)cout<<-1<<"\n";
		else if(x<=9&&h%3>=1||w%3>=1){
			for(int i=0;i<h;i+=3){
				for(int j=0;j<w;j+=3){
					if(w%3>=1)ans[i+1][j]=x;
					else ans[i][j+1]=x;
				}
			}
			write(ans);
		}else if(x<=18&&h%3==2||w%3==2){
			for(int i=0;i<h;i+=3){
				for(int j=0;j<w;j+=3){
					if(w%3>=2)ans[i+1][j]=x/2,ans[i+1][j+1]=x-x/2;
					else ans[i][j+1]=x/2,ans[i+1][j+1]=x-x/2;
				}
			}
		}else{
			cout<<-1<<"\n";
		}
	}else if(x>36){
		cout<<-1<<"\n";
	}else if(x>18){
		if(h%3==2&&w%3==2){
			for(int i=0;i<h;i+=3){
				for(int j=0;j<w;j+=3){
					ans[i][j]=x/4;ans[i+1][j]=x/4;
					ans[i][j+1]=x/4;ans[i+1][j+1]=x-3*(x/4);
				}
			}
			write(ans);
		}else{
			cout<<-1<<"\n";
		}
	}else if(x>9){
		if(h%3==2){
			for(int i=0;i<h;i+=3){
				for(int j=0;j<w;j+=3){
					ans[i][j]=x/2,ans[i+1][j]=x-x/2;
				}
			}
			write(ans);
		}else if(w%3==2){
			for(int i=0;i<h;i+=3){
				for(int j=0;j<w;j+=3){
					ans[i][j]=x/2,ans[i][j+1]=x-x/2;
				}
			}
			write(ans);
		}else{
			cout<<-1<<"\n";
		}
	}else{
		for(int i=0;i<h;i+=3)for(int j=0;j<w;j+=3)ans[i][j]=x;
		write(ans);
	}
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}