#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define rrep2(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); --i)

#define all(v) begin(v), end(v)

using namespace std;

using ll = long long;

constexpr ll inf = 1e18;

template<class T, class U> bool chmin(T& a, const U& b) { return a > b ? a = b, true : false; }
template<class T, class U> bool chmax(T& a, const U& b) { return a < b ? a = b, true : false; }

int main() {
    int N, S, T; cin >> N >> S >> T;
    vector<vector<int>> A(N, vector<int>(S));
    rep (i, N) rep (j, S) cin >> A[i][j], --A[i][j];
    vector<int> B(T, -1);
    queue<pair<int, int>> que;
    que.emplace(0, S);
    while (!que.empty()) {
        auto [l, r] = que.front(); que.pop();
        int m = (l + r) / 2;
        vector<int> C;
        vector<vector<pair<int, int>>> D;
        rep (i, N) rep2 (j, l, r) {
            if (B[A[i][j]] == -1) {
                C.push_back(A[i][j]);
                D.push_back({{i, j}});
                B[A[i][j]] = C.size() - 1;
                A[i][j] = C.size() - 1;
            }
            else {
                int t = B[A[i][j]];
                B[A[i][j]] = -1;
                D[t].push_back({i, j});
                A[i][j] = t;
            }
        }
        rep (i, C.size()) B[C[i]] = -1;
        vector<vector<pair<int, int>>> E(N, vector<pair<int, int>>(r - l));
        {
            vector<pair<int, int>> F;
            rep (i, D.size()) {
                if (D[i].size() == 2) {
                    E[D[i][0].first][D[i][0].second - l] = D[i][1];
                    E[D[i][1].first][D[i][1].second - l] = D[i][0];
                }
                else {
                    F.push_back(D[i][0]);
                }
            }
            rep (i, F.size() / 2) {
                E[F[i * 2].first][F[i * 2].second - l] = F[i * 2 + 1];
                E[F[i * 2 + 1].first][F[i * 2 + 1].second - l] = F[i * 2];
            }
        }
        vector<vector<int>> res(N, vector<int>(r - l));
        vector<int> L(N, l), R(N, m);
        vector<vector<bool>> used(N, vector<bool>(r - l));
        vector<int> idx(N, l);
        rep (i, N) {
            while (idx[i] < r) {
                int ci = i, cj = idx[i]++;
                if (used[ci][cj - l]) continue;
                do {
                    used[ci][cj - l] = true;
                    res[ci][(L[ci]++) - l] = A[ci][cj];
                    auto [ni, nj] = E[ci][cj - l];
                    used[ni][nj - l] = true;
                    res[ni][(R[ni]++) - l] = A[ni][nj];
                    while (idx[ni] < r && used[ni][idx[ni] - l]) ++idx[ni];
                    ci = ni, cj = idx[ni]++;
                } while (ci != i);
                --idx[i];
            }
        }
        rep (i, N) {
            rep (j, r - l) A[i][l + j] = C[res[i][j]];
        }
        if (l + 1 != m) que.emplace(l, m);
        if (m + 1 != r) que.emplace(m, r);
    }
    rep (i, N) {
        rep (j, S) cout << A[i][j] + 1 << " \n"[j + 1 == S];
    }
}