#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y);
long long mpower(long long x, long long y, long long p);
long long modInv(long long a, long long m);
long long gcdExtended(long long a, long long b, long long *x, long long *y);
bool isPrime(long long n);
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t, i, j, k, l, h, p, q, r, x, y, z, a, b, c, d, f, n, m,
      M = 1000000007;
  char ch, ch2, ch3;
  string s, s1, s2, s3;
  t = 1;
  while (t--) {
    vector<pair<long long, long long> > v, w;
    unordered_map<long long, long long> N;
    set<pair<long long, long long> > S, SS;
    cin >> n >> m;
    long long A[n][m], B[n], C[m], X[n][m];
    for (i = 0; i < n; i++) {
      for (j = 0; j < m; j++) {
        cin >> A[i][j];
      }
    }
    for (i = 0; i < n; i++) {
      B[i] = 0;
      for (j = 0; j < m; j++) {
        B[i] = max(B[i], A[i][j]);
      }
    }
    for (j = 0; j < m; j++) {
      C[j] = 0;
      for (i = 0; i < n; i++) {
        C[j] = max(C[j], A[i][j]);
      }
    }
    sort(B, B + n, greater<long long>());
    sort(C, C + m, greater<long long>());
    p = n * m;
    long long Z[p + 1];
    for (i = 0; i <= p; i++) {
      Z[i] = 0;
    }
    Z[0] = 1;
    Z[p] = 1;
    for (i = 0; i < n; i++) {
      for (j = 0; j < m; j++) {
        X[i][j] = -1;
      }
    }
    X[0][0] = p;
    b = 1;
    c = 1;
    for (i = p - 1; i >= 0; i--) {
      if (b < n && B[b] == i && c < m && C[c] == i) {
        Z[i] = 1;
        X[b][c] = i;
        for (j = c - 1; j >= 0; j--) {
          v.push_back(make_pair(b, j));
        }
        for (j = b - 1; j >= 0; j--) {
          v.push_back(make_pair(j, c));
        }
        b++;
        c++;
      } else if (b < n && B[b] == i) {
        Z[i] = 1;
        X[b][c - 1] = i;
        for (j = c - 2; j >= 0; j--) {
          v.push_back(make_pair(b, j));
        }
        b++;
      } else if (c < m && C[c] == i) {
        Z[i] = 1;
        X[b - 1][c] = i;
        for (j = b - 2; j >= 0; j--) {
          v.push_back(make_pair(j, c));
        }
        c++;
      }
    }
    j = 0;
    for (i = p; i > 0; i--) {
      if (!Z[i]) {
        Z[i] = 1;
        X[v[j].first][v[j].second] = i;
        j++;
      }
    }
    for (i = 0; i < n; i++) {
      for (j = 0; j < m; j++) {
        cout << X[i][j] << " ";
      }
      cout << "\n";
    }
  }
  return 0;
}
long long modInv(long long a, long long m) {
  long long x, y;
  long long g = gcdExtended(a, m, &x, &y);
  long long res = (x % m + m) % m;
  return res;
}
long long gcdExtended(long long a, long long b, long long *x, long long *y) {
  if (a == 0) {
    *x = 0, *y = 1;
    return b;
  }
  long long x1, y1;
  long long gcd = gcdExtended(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
long long mpower(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long power(long long x, long long y) {
  long long res = 1;
  while (y > 0) {
    if (y & 1) res = res * x;
    y = y >> 1;
    x = x * x;
  }
  return res;
}
bool isPrime(long long n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  long long p = sqrt(n);
  for (int i = 5; i <= p; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
