import std.stdio, std.conv, std.functional, std.string; import std.algorithm, std.array, std.container, std.range, std.typecons; import std.bigint, std.numeric, std.math, std.random; import core.bitop; string FMT_F = "%.10f"; static File _f; void file_io(string fn) { _f = File(fn, "r"); } static string[] s_rd; T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; } T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; } T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; } T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; } T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; } T[] RDA(T = long)(T fix = 0) { if (_f.isOpen) return _RDA!T(_f, fix); else return _RDA!T(fix); } size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;} size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; } void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); } bool inside(T)(T x, T b, T e) { return x >= b && x < e; } T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); } //long mod = 10^^9 + 7; long mod = 998_244_353; //long mod = 1_000_003; void moda(ref long x, long y) { x = (x + y) % mod; } void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; } void modm(ref long x, long y) { x = (x * y) % mod; } void modpow(ref long x, long y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); } void modd(ref long x, long y) { y.modpow(mod - 2); x.modm(y); } void main() { auto W = RD; auto H = RD; auto X = RD; long[][] ans; bool isSwap; if (X <= 18) { if (W % 3 == 2 || H % 2 == 2) { if (W % 3 != 2) { isSwap = true; swap(H, W); } auto a = min(9, X); auto b = max(0, X-9); ans = new long[][](H, W); foreach (y; 0..H) { if (y % 2) continue; foreach (x; 0..W) { if (x % 3 == 0) ans[y][x] = a; else if (x % 3 == 1) ans[y][x] = b; } } } } else if (X <= 36) { if (W % 3 == 2 && H % 2 == 2) { auto a = 9; auto b = 9; auto c = min(9, X-18); auto d = max(0, X-27); ans = new long[][](H, W); foreach (y; 0..H) { if (y % 3 == 2) continue; foreach (x; 0..W) { if (x % 3 == 0) { if (y % 3 == 0) ans[y][x] = a; else ans[y][x] = c; } else if (x % 3 == 1) { if (y % 3 == 0) ans[y][x] = b; else ans[y][x] = d; } } } } } if (ans.empty) writeln(-1); else if (isSwap) { foreach (x; 0..W) { foreach (y; 0..H) { write(ans[y][x]); } writeln; } } else { foreach (y; 0..H) ans[y].map!(to!string).join("").writeln; } stdout.flush; debug readln; }