#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

const int N = 1e5 + 5, M = 5e5 + 5; 

int n, s, t, E;
vector<int> v[N], ans[N], id[N];
vector<pair<int, int>> e[M];
vector<pair<int, int>>::iterator it[M];
int dir[M * 2];

void Dfs (int u, int la) {
  while (it[u] != e[u].end()) {
    pair<int, int> t = *it[u]++;
    int v = t.first, id = t.second;
    if (dir[id] != -1) continue; 
    dir[id] = (u < v);
    Dfs(v, id);
  }
}

void Solve (int l, int r) {
  if (l == r - 1) return;  
  int mid = (l + r) >> 1;
  vector<int> p; 
  for (int i = 1; i <= n; ++i) {
    for (int j = l; j < r; ++j) {
      p.push_back(v[i][j]);
    }
  }
  sort(p.begin(), p.end());
  p.resize(unique(p.begin(), p.end()) - p.begin());
  for (int i = 1; i <= n; ++i) {
    for (int j = l; j < r; ++j) {
      v[i][j] = lower_bound(p.begin(), p.end(), v[i][j]) - p.begin() + 1; 
    }
  }
  t = p.size(), E = 0; 
  fill(e + 1, e + t + 2, vector<pair<int, int>>());
  for (int i = 1; i <= n; ++i) {
    for (int j = l, k = mid; j < mid; ++j, ++k) {
      if (v[i][j] == v[i][k])
        id[i][j] = 0; 
      else {
        id[i][j] = ++E;
        e[v[i][j]].push_back({v[i][k], E});
        e[v[i][k]].push_back({v[i][j], E});
      }
    }
  }
  ++t;
  for (int i = 1; i < t; ++i) {
    if (e[i].size() & 1) {
      ++E;
      e[i].push_back({t, E});
      e[t].push_back({i, E});
    }
  }
  fill(dir + 1, dir + E + 1, -1);
  for (int i = 1; i <= t; ++i) {
    it[i] = e[i].begin();
  }
  for (int i = 1; i <= t; ++i) {
    if (it[i] != e[i].end())
      Dfs(i, 0);
  }
  for (int i = 1; i <= n; ++i) {
    for (int j = l, k = mid; j < mid; ++j, ++k) {
      if (id[i][j] && (dir[id[i][j]] ^ (v[i][j] < v[i][k])))
        swap(v[i][j], v[i][k]), swap(ans[i][j], ans[i][k]);
    }
  }
  Solve(l, mid), Solve(mid, r);
}

int main () {
  cin.tie(0)->sync_with_stdio(0);
  cin >> n >> s >> t;
  fill(v + 1, v + n + 1, vector<int>(s));
  fill(id + 1, id + n + 1, vector<int>(s));
  for (int i = 1; i <= n; ++i) {
    for (auto &x : v[i])
      cin >> x;
  }
  copy(v + 1, v + n + 1, ans + 1);
  Solve(0, s); 
  for (int i = 1; i <= n; ++i) {
    for (int j = 0; j < s; ++j) {
      cout << ans[i][j] << ' ';
    } 
    cout << '\n';
  }
  return 0;
}