#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void ckmax(T& x, T y) {
  x = (y > x ? y : x);
}
template <typename T>
inline void ckmin(T& x, T y) {
  x = (y < x ? y : x);
}
namespace Fread {
const int SIZE = 1 << 21;
char buf[SIZE], *S, *T;
inline char getchar() {
  if (S == T) {
    T = (S = buf) + fread(buf, 1, SIZE, stdin);
    if (S == T) return '\n';
  }
  return *S++;
}
}  // namespace Fread
namespace Fwrite {
const int SIZE = 1 << 21;
char buf[SIZE], *S = buf, *T = buf + SIZE;
inline void flush() {
  fwrite(buf, 1, S - buf, stdout);
  S = buf;
}
inline void putchar(char c) {
  *S++ = c;
  if (S == T) flush();
}
struct NTR {
  ~NTR() { flush(); }
} ztr;
}  // namespace Fwrite
namespace Fastio {
struct Reader {
  template <typename T>
  Reader& operator>>(T& x) {
    char c = Fread ::getchar();
    T f = 1;
    while (c < '0' || c > '9') {
      if (c == '-') f = -1;
      c = Fread ::getchar();
    }
    x = 0;
    while (c >= '0' && c <= '9') {
      x = x * 10 + (c - '0');
      c = Fread ::getchar();
    }
    x *= f;
    return *this;
  }
  Reader& operator>>(char& c) {
    c = Fread ::getchar();
    while (c == '\n' || c == ' ') c = Fread ::getchar();
    return *this;
  }
  Reader& operator>>(char* str) {
    int len = 0;
    char c = Fread ::getchar();
    while (c == '\n' || c == ' ') c = Fread ::getchar();
    while (c != '\n' && c != ' ') {
      str[len++] = c;
      c = Fread ::getchar();
    }
    str[len] = '\0';
    return *this;
  }
  Reader() {}
} cin;
const char endl = '\n';
struct Writer {
  template <typename T>
  Writer& operator<<(T x) {
    if (x == 0) {
      Fwrite ::putchar('0');
      return *this;
    }
    if (x < 0) {
      Fwrite ::putchar('-');
      x = -x;
    }
    static int sta[45];
    int top = 0;
    while (x) {
      sta[++top] = x % 10;
      x /= 10;
    }
    while (top) {
      Fwrite ::putchar(sta[top] + '0');
      --top;
    }
    return *this;
  }
  Writer& operator<<(char c) {
    Fwrite ::putchar(c);
    return *this;
  }
  Writer& operator<<(char* str) {
    int cur = 0;
    while (str[cur]) Fwrite ::putchar(str[cur++]);
    return *this;
  }
  Writer& operator<<(const char* str) {
    int cur = 0;
    while (str[cur]) Fwrite ::putchar(str[cur++]);
    return *this;
  }
  Writer() {}
} cout;
}  // namespace Fastio
const int MAXN = 1e6;
int n, m, cnt;
pair<int, pair<int, int> > a[MAXN + 5];
int ans[MAXN + 5];
int mxr[MAXN + 5], mxc[MAXN + 5];
int lstr[MAXN + 5], lstc[MAXN + 5];
int fa[MAXN + 5], sz[MAXN + 5], mx[MAXN + 5];
int get_fa(int u) { return (u == fa[u]) ? u : (fa[u] = get_fa(fa[u])); }
void unite(int u, int v) {
  u = get_fa(u);
  v = get_fa(v);
  if (u != v) {
    if (sz[u] > sz[v]) swap(u, v);
    fa[u] = v;
    sz[v] += sz[u];
    ckmax(mx[v], mx[u]);
  }
}
int main() {
  Fastio ::cin >> n >> m;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= m; ++j) {
      ++cnt;
      Fastio ::cin >> a[cnt].first;
      a[cnt].second = make_pair(i, j);
    }
  }
  sort(a + 1, a + cnt + 1);
  for (int i = 1; i <= cnt; ++i) {
    int j = i;
    while (j + 1 <= cnt && a[j + 1].first == a[i].first) ++j;
    for (int k = i; k <= j; ++k) {
      int r = a[k].second.first;
      int c = a[k].second.second;
      mx[k] = max(mxr[r], mxc[c]) + 1;
      fa[k] = k;
      sz[k] = 1;
      if (lstr[r]) {
        unite(k, lstr[r]);
      }
      if (lstc[c]) {
        unite(k, lstc[c]);
      }
      lstr[r] = lstc[c] = k;
    }
    for (int k = i; k <= j; ++k) {
      int r = a[k].second.first;
      int c = a[k].second.second;
      ans[(r - 1) * m + c] = mx[get_fa(k)];
      mxr[r] = mxc[c] = mx[get_fa(k)];
      lstr[r] = lstc[c] = 0;
    }
    i = j;
  }
  cnt = 0;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= m; ++j) {
      ++cnt;
      Fastio ::cout << ans[cnt] << " \n"[j == m];
    }
  }
  return 0;
}
