#include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
mt19937 rnd(std::chrono::high_resolution_clock::now().time_since_epoch().count());
void assign(vector<vector<ll>>& a, ll& c) {
    for (ll i = 0; i < (ll)a.size(); i++) {
        for (ll j = 0; j < (ll)a[i].size(); j++) {
            a[i][j] = rand() % c + 1;
        }
    }
}
ld gen() {
    ll x = rand() + 1;
    ll y = rand() + 1;
    x %= y;
    return (ld)x / (ld)y;
}
ll gen_rand_color(vector<vector<ll>>& a, ll clr, ll i, ll j, ll c) {
    ll f = clr;
    if (a[i][j] == f) {
        if (a[i][j] == c) {
            f--;
        }
        else if (a[i][j] == 1) {
            f++;
        }
        else {
            ll ind = rand() % 2;
            if (ind) {
                f--;
            }
            else {
                f++;
            }
        }
    }
    return f;
}
ll calc(vector<vector<ll>>& a) {
    ll res = 0;
    ll n = a.size(), m = a[0].size();
    for (ll i = 0; i < n; i++) {
        for (ll j = 0; j < m; j++) {
            for (ll d = 1; d < n; d++) {
                if (i + d >= n)break;
                for (ll k = 1; k < m; k++) {
                    if (j + k >= m)break;
                    if (a[i][j] == a[i][j + k] && a[i][j] == a[i + d][j] && a[i + d][j + k] == a[i + d][j]) {
                        res++;
                    }
                }
            }
        }
    }
    return res;
}
void recalc(vector<vector<ll>>& a, ll& ans, ll i, ll j, ll upd) {
    ll n = a.size(), m = (ll)a[0].size();
    for (ll d = 1; d < n; d++) {
        if (i + d >= n)break;
        for (ll k = 1; k < m; k++) {
            if (j + k >= m)break;
            if (a[i][j] == a[i][j + k] && a[i][j] == a[i + d][j] && a[i + d][j + k] == a[i + d][j]) {
                ans--;
            }
            if (upd == a[i][j + k] && upd == a[i + d][j] && a[i + d][j + k] == a[i + d][j]) {
                ans++;
            }
        }
    }
}
void print(vector<vector<ll>>& a) {
    for (ll i = 0; i < (ll)a.size(); i++) {
        for (ll j = 0; j < (ll)a[i].size(); j++) {
            cout << a[i][j] << ' ';
        }
        cout << '\n';
    }
    return;
}
signed main() {
    //   freopen("input.txt", "r", stdin);
    //   freopen("output.txt", "w", stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    srand(time(NULL));
    ll n, m, c;
    cin >> n >> m >> c;
    ll cur[10][10] = {
            {2, 3, 2, 3, 1, 3, 2, 1, 2, 1},
            {1, 3, 2, 2, 3, 2, 1, 1, 1, 3},
            {3, 3, 3, 1, 1, 1, 2, 2, 1, 2},
            {1, 1, 3, 3, 1, 2, 3, 2, 2, 3},
            {2, 2, 1, 3, 1, 2, 1, 3, 3, 2},
            {1, 2, 2, 1, 2, 3, 3, 2, 3, 1},
            {2, 1, 3, 2, 3, 1, 1, 2, 3, 1},
            {1, 3, 1, 2, 2, 1, 3, 3, 2, 2},
            {3, 2, 1, 2, 3, 3, 2, 3, 1, 1},
            {3, 1, 1, 1, 2, 2, 2, 1, 3, 3}
    };
    if(n==10&&m==10&&c==3){
        for(int i=0;i<n;i++){
            for(int j=0;j<m;j++){
                cout<<cur[i][j]<<' ';
            }
            cout<<'\n';
        }
        return 0;
    }
    vector<vector<ll>> a(n, vector<ll>(m));
    assign(a, c);
    ll ans = calc(a);
    ld t_[3] = { 1.00,10.00,(ld)n }, q_[3] = { 0.95,0.9995,0.9999 };
    while (true) {
        const ld eps = 1e-3;
        ld t = t_[rand()%3], q = q_[rand()%3];
        while (t > eps) {
            vector<vector<ll>> buf = a;
            ll pre_ans = ans;
            ll x = rand() % n, y = rand() % m;
            ll clr = rand() % c + 1;
            clr = gen_rand_color(a, clr, x, y, c);/*
                recalc(buf,x,y,pre_ans,clr);
                buf[x][y]=clr;
                if(pre_ans==0){
                    print(buf);
                    return 0;
                }*/
            recalc(buf, pre_ans, x, y, clr);
            buf[x][y] = clr;
            pre_ans = calc(buf);
            if (gen() <= exp((ld)(ans - pre_ans) / (ld)t) || pre_ans < ans) {
                a = buf, ans = pre_ans;
            }
            if (ans == 0) {
                print(a);
                return 0;
            }
            t *= q;
        }
    }
}