#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
template <typename A>
ostream &operator<<(ostream &cout, vector<A> const &v);
template <typename A, typename B>
ostream &operator<<(ostream &cout, pair<A, B> const &p) {
  return cout << "(" << p.first << ", " << p.second << ")";
}
template <typename A>
ostream &operator<<(ostream &cout, vector<A> const &v) {
  cout << "[";
  for (int i = 0; i < v.size(); i++) {
    if (i) cout << ", ";
    cout << v[i];
  }
  return cout << "]";
}
template <typename A, typename B>
istream &operator>>(istream &cin, pair<A, B> &p) {
  cin >> p.first;
  return cin >> p.second;
}
mt19937 rng(steady_clock::now().time_since_epoch().count());
void usaco(string filename) {
  freopen((filename + ".in").c_str(), "r", stdin);
  freopen((filename + ".out").c_str(), "w", stdout);
}
const long double pi = 3.14159265358979323846;
long long n, m, k, q, l, r, x, y, z;
long long a[1000005];
long long b[1000005];
long long c[1000005];
string second, t;
long long ans = 0;
long long mat[255][255];
bool vis[255][255];
long long mr[255], mc[255];
long long cnt[255][255];
long long omat[255][255];
const long long dr[4] = {0, 0, -1, 1};
const long long dc[4] = {1, -1, 0, 0};
bool valid(long long r, long long c) {
  return r >= 0 && r < n && c >= 0 && c < m;
}
void solve(int tt) {
  cin >> n >> m;
  for (long long i = 0; i < (n); ++i)
    for (int ele = 0; ele < m; ele++) cin >> mat[i][ele];
  ;
  memset(vis, 0, sizeof(vis));
  memset(mr, 0, sizeof(mr));
  memset(mc, 0, sizeof(mc));
  for (long long i = 0; i < (n); ++i) {
    for (long long j = 0; j < (m); ++j) {
      --mat[i][j];
      mr[i] = max(mr[i], mat[i][j]);
      mc[j] = max(mc[j], mat[i][j]);
    }
  }
  memset(cnt, 0, sizeof(cnt));
  pair<long long, long long> pos = make_pair(-1, -1);
  for (long long i = 0; i < (n); ++i)
    for (long long j = 0; j < (m); ++j) omat[i][j] = -1;
  set<pair<long long, long long> > safe;
  for (long long i = (n * m - 1); i >= 0; --i) {
    bool rr = 0, rc = 0;
    for (long long j = 0; j < (n); ++j) {
      if (mr[j] == i) {
        rr = 1;
      }
    }
    for (long long j = 0; j < (m); ++j) {
      if (mc[j] == i) {
        rc = 1;
      }
    }
    if (rr) ++pos.first;
    if (rc) ++pos.second;
    pair<long long, long long> loc = pos;
    if (!rr && !rc) {
      if (!safe.size()) {
        cout << -1 << '\n';
        return;
      }
      loc = *safe.begin();
      safe.erase(safe.begin());
    }
    omat[loc.first][loc.second] = i + 1;
    for (long long d = 0; d < (4); ++d) {
      long long ni = loc.first + dr[d], nj = loc.second + dc[d];
      if (valid(ni, nj)) {
        ++cnt[ni][nj];
        if (cnt[ni][nj] == 2 && omat[ni][nj] == -1) {
          safe.insert(make_pair(ni, nj));
        }
      }
    }
  }
  for (long long i = 0; i < (n); ++i) {
    for (int ele = 0; ele < (m); ele++) {
      if (ele) cout << " ";
      cout << omat[i][ele];
    }
    cout << '\n';
  };
}
int main() {
  { ios_base::sync_with_stdio(false); }
  {
    cin.tie(NULL);
    cout.tie(NULL);
  }
  int tc = 1;
  for (int t = 0; t < tc; t++) solve(t);
}
