#include <cstdio>
#include <set>
#include <algorithm>
using namespace std;
const int N = 1000 + 10;
int n, m, G[N][N];
set<int> r[N][N];
int main() {
    freopen("matrixa.in", "r", stdin);
    freopen("matrixa.out", "w", stdout);
    while(scanf("%d %d", &m, &n) == 2) {
        for(int i=1; i<=m; i++)
            for(int j=1; j<=n; j++)
                scanf("%d", &G[i][j]);
        for(int i=1; i<=m; i++)
            for(int j=1; j<=n; j++) {
                set_union(r[i][j-1].begin(), r[i][j-1].end(),
                        r[i-1][j].begin(), r[i-1][j].end(),
                        inserter(r[i][j], r[i][j].begin()));
                r[i][j].insert(G[i][j]);
            }
        for(int i=1; i<=m; i++) {
            for(int j=1; j<=n; j++)
                printf("%d ", r[i][j].size());
            printf("\n");
        }
    }
    return 0;
}