#include <bits/stdc++.h>
using namespace std;
void cppio() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
}
int n, m;
int z;
int a[300][300];
pair<int, int> pos[300 * 300];
bool mR[300];
bool mC[300];
struct Sinf {
  int val;
  bool row, col;
};
vector<Sinf> surprise;
bool chk[300][300];
int ans[300][300];
int main() {
  cppio();
  cin >> n >> m;
  for (int i = 1; i <= (n); ++i)
    for (int j = 1; j <= (m); ++j) {
      cin >> a[i][j];
      pos[a[i][j]] = {i, j};
    }
  z = n * m;
  for (int i = z; 1 <= i; --i) {
    int first, second;
    tie(first, second) = pos[i];
    bool R = !mR[first];
    bool C = !mC[second];
    if (!R && !C) continue;
    surprise.push_back({i, R, C});
    mR[first] = mC[second] = 1;
  }
  int sN = (int)(surprise).size();
  vector<pair<int, int> > cand;
  int lx = 0, ly = 0;
  for (auto &ss : surprise) {
    if (ss.row) ++lx;
    if (ss.col) ++ly;
    if (0) printf("surprise of %d\n", ss.val);
    if (ss.row) {
      if (0) printf("row: (%d, %d) to (%d, %d)\n", lx, ly - 1, lx, 1);
      for (int i = ly - 1; i >= 1; --i) cand.emplace_back(lx, i);
    }
    if (ss.col) {
      if (0) printf("col: (%d, %d) to (%d, %d)\n", lx - 1, ly, 1, ly);
      for (int i = lx - 1; i >= 1; --i) cand.emplace_back(i, ly);
    }
    ans[lx][ly] = ss.val;
  }
  int idx = 0;
  for (int i = 1; i < sN; ++i) {
    int f = surprise[i].val + 1;
    int t = surprise[i - 1].val - 1;
    for (int j = t; j >= f; --j) {
      int first, second;
      tie(first, second) = cand[idx++];
      ans[first][second] = j;
    }
  }
  for (int i = surprise[sN - 1].val - 1; i >= 1; --i) {
    int first, second;
    tie(first, second) = cand[idx++];
    ans[first][second] = i;
  }
  if (0) {
    for (int i = 1; i <= (n); ++i) {
      int j;
      for (j = 1; j < m; ++j)
        if (ans[i][j] > ans[i][j + 1]) break;
      for (; j < m; ++j)
        if (ans[i][j] < ans[i][j + 1]) break;
      if (j < m) {
        cout << "-1\n";
        return 0;
      }
    }
    for (int j = 1; j <= (m); ++j) {
      int i;
      for (i = 1; i < n; ++i)
        if (ans[i][j] > ans[i + 1][j]) break;
      for (; i < n; ++i)
        if (ans[i][j] < ans[i + 1][j]) break;
      if (i < n) {
        cout << "-1\n";
        return 0;
      }
    }
  }
  for (int i = 1; i <= (n); ++i) {
    for (int j = 1; j <= (m); ++j) cout << ans[i][j] << ' ';
    cout << '\n';
  }
  return 0;
}
