#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
int main() {
	int w, h, x;
	cin >> w >> h >> x;
	if (h == 1 && w == 1) {
		if (x > 9) {
			cout << -1 << endl;
		}
		else {
			cout << x << endl;
		}
	}
	else if (h == 1) {
		if (x > 18) {
			cout << -1 << endl;
		}
		else {
			for (int i = 0; i < w; i++) {
				if (i % 3 == 0) {
					cout << x / 9 * 9;
					if (i != w - 1) {
						cout << " ";
					}
				}
				else if (i % 3 == 1) {
					cout << x % 9;
					if (i != w - 1) {
						cout << " ";
					}
				}
				else {
					cout << 0;
					if (i != w - 1) {
						cout << " ";
					}
				}
			}
			cout << endl;
		}
	}
	else if (w == 1) {
		if (x > 18) {
			cout << -1 << endl;
		}
		else {
			for (int i = 0; i < h; i++) {
				if (i % 3 == 0) {
					cout << x / 9 * 9 << endl;
				}
				else if (i % 3 == 1) {
					cout << x % 9 << endl;
				}
				else {
					cout << 0 << endl;
				}
			}
		}
	}
	else {
		if (x > 36) {
			cout << -1 << endl;
			return 0;
		}
		else {
			int k[3][3];
			for (int i = 2; i >= 0; i--) {
				for (int j = 2; j >= 0; j--) {
					if (i == 2 || j == 2) {
						k[i][j] = 0;
					}
					else if (x <= 9) {
						k[i][j] = x;
						x = 0;
					}
					else {
						k[i][j] = 9;
						x -= 9;
					}
				}
			}

			for (int i = 0; i < h; i++) {
				for (int j = 0; j < w; j++) {
					cout << k[i % 3][j % 3];
					if (j != w - 1) {
						cout << " ";
					}
				}
				cout << endl;
			}
		}
	}
}