#include <bits/stdc++.h>
#include <random>
using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef long double ld; typedef pair<lint, lint> plint; typedef pair<ld, ld> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i<i##_end_;++i)
#define IFOR(i, begin, end) for(lint i=(end)-1,i##_begin_=(begin);i>=i##_begin_;--i)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define endk '\n'
#define fi first
#define se second
struct fast_ios { fast_ios() { cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
template<class T> auto add = [](T a, T b) -> T { return a + b; };
template<class T> auto f_max = [](T a, T b) -> T { return max(a, b); };
template<class T> auto f_min = [](T a, T b) -> T { return min(a, b); };
template<class T> using V = vector<T>;
using Vl = V<lint>; using VVl = V<Vl>;
template< typename T > ostream& operator<<(ostream& os, const vector< T >& v) {
    for (int i = 0; i < (int)v.size(); i++) os << v[i] << (i + 1 != v.size() ? " " : "");
    return os;
}
template< typename T >istream& operator>>(istream& is, vector< T >& v) {
    for (T& in : v) is >> in;
    return is;
}
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
lint gcd(lint a, lint b) { if (b == 0) return a; else return gcd(b, a % b); }
lint ceil(lint a, lint b) { return (a + b - 1) / b; }
lint digit(lint a) { return (lint)log10(a); }
lint e_dist(plint a, plint b) { return abs(a.fi - b.fi) * abs(a.fi - b.fi) + abs(a.se - b.se) * abs(a.se - b.se); }
lint m_dist(plint a, plint b) { return abs(a.fi - b.fi) + abs(a.se - b.se); }
void Worshall_Floyd(VVl& g) { REP(k, SZ(g)) REP(i, SZ(g)) REP(j, SZ(g)) chmin(g[i][j], g[i][k] + g[k][j]); }
const lint MOD1000000007 = 1000000007, MOD998244353 = 998244353, INF = 1e18;
lint dx[8] = { 1, 0, -1, 0, 1, -1, 1, -1 }, dy[8] = { 0, 1, 0, -1, -1, -1, 1, 1 };
bool YN(bool flag) { cout << (flag ? "YES" : "NO"); return flag; } bool yn(bool flag) { cout << (flag ? "Yes" : "No") << endk; return flag; }
struct Edge {
    lint from, to;
    lint cost;
    lint idx;
    Edge() {

    }
    Edge(lint u, lint v, lint c, lint i) {
        cost = c;
        from = u;
        to = v;
        idx = i;
    }
    bool operator<(const Edge& e) const {
        return cost < e.cost;
    }
};
struct WeightedEdge {
    lint to;
    lint cost;
    WeightedEdge(lint v, lint c = 1) {
        to = v;
        cost = c;
    }
    bool operator<(const WeightedEdge& e) const {
        return cost < e.cost;
    }
};
using WeightedGraph = V<V<WeightedEdge>>;
typedef pair<plint, lint> tlint;
typedef pair<plint, plint> qlint;
typedef pair<char, lint> valchar;

lint H, W, X;
int main() {
    cin >> W >> H >> X;
    Vl arr(4);
    if (H == 1 && W == 1 && X <= 9) {
        cout << X << endk;
        return 0;
    }
    if (H == 1 && W % 3 == 2 && X <= 18) {
        REP(i, H) {
            REP(j, W) {
                if (j % 3 == 0) {
                    cout << min(X, 9ll);
                }
                else if (j % 3 == 1) {
                    cout << X - min(X, 9ll);
                }
                else {
                    cout << 0;
                }
                if (j != W - 1) cout << " ";
            }
            cout << endk;
        }
        return 0;
    }
    if (W == 1 && H % 3 == 2 && X <= 18) {
        REP(i, H) {
            REP(j, W) {
                if (i % 3 == 0) {
                    cout << min(X, 9ll);
                }
                else if (i % 3 == 1) {
                    cout << X - min(X, 9ll);
                }
                else {
                    cout << 0;
                }
                if (j != W - 1) cout << " ";
            }
            cout << endk;
        }
        return 0;
    }
    else if (H % 3 == 2 && W % 3 == 2 && X <= 36) {
        REP(i, 4) {
            arr[i] = min(9ll, X);
            X -= arr[i];
        }
        REP(i, H) {
            REP(j, W) {
                if (i % 3 == 2) {
                    cout << 0;
                }
                else {
                    if (j % 3 == 2) {
                        cout << 0;
                    }
                    else {
                        cout << arr[i % 3 + (j % 3) * 2];
                    }
                }
                if (j != W - 1) {
                    cout << " ";
                }
            }
            cout << endk;
        }
        return 0;
    }
    cout << -1 << endk;
}