#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
using namespace std;

#ifdef WAIMAI
#define debug(HEHE...) cout << "[" << #HEHE << "] : ", dout(HEHE)
void dout() {cout << '\n';}
template<typename T, typename...U>
void dout (T t, U...u) {cout << t << (sizeof... (u) ? ", " : ""), dout (u...);}
#else
#define debug(...) 7122
#endif

#define ll long long
#define Waimai ios::sync_with_stdio(false), cin.tie(0)
#define FOR(x,a,b) for (int x = a, I = b; x <= I; x++)
#define pb emplace_back
#define F first
#define S second

const int SIZE = 505;

int n, m, sz;
string s[SIZE];
int ans[SIZE][SIZE], deg[SIZE][SIZE];
bool cmp[SIZE][SIZE]; // cmp[i][j] = 0 : a[i][j] < a[i][j + 1], 1 : a[i][j] > a[i][j + 1]
vector<pair<int, int>> adj[SIZE][SIZE];

void solve() {
    cin >> n >> m;
    FOR (i, 1, n - 1) cin >> s[i], s[i] = " " + s[i];
    FOR (i, 1, n - 1) FOR (j, 1, m - 1) {
        if (cmp[i][j] == 0) {
            if (s[i][j] == '1') {
                adj[i][j].pb(i, j + 1);
                adj[i][j + 1].pb(i + 1, j);
                adj[i + 1][j].pb(i + 1, j + 1);
            }
            if (s[i][j] == '2') {
                adj[i][j].pb(i, j + 1);
                adj[i][j + 1].pb(i + 1, j + 1);
                adj[i + 1][j + 1].pb(i + 1, j);
                cmp[i + 1][j] = 1;
            }
            if (s[i][j] == '3') {
                adj[i][j].pb(i + 1, j);
                adj[i + 1][j].pb(i, j + 1);
                adj[i][j + 1].pb(i + 1, j + 1);
            }
        } else {
            if (s[i][j] == '1') {
                adj[i][j + 1].pb(i, j);
                adj[i][j].pb(i + 1, j + 1);
                adj[i + 1][j + 1].pb(i + 1, j);
                cmp[i + 1][j] = 1;
            }
            if (s[i][j] == '2') {
                adj[i][j + 1].pb(i, j);
                adj[i][j].pb(i + 1, j);
                adj[i + 1][j].pb(i + 1, j + 1);
            }
            if (s[i][j] == '3') {
                adj[i][j + 1].pb(i + 1, j + 1);
                adj[i + 1][j + 1].pb(i, j);
                adj[i][j].pb(i + 1, j);
                cmp[i + 1][j] = 1;
            }
        }
    }
    FOR (i, 1, n) FOR (j, 1, m) for (auto [ti, tj] : adj[i][j]) deg[ti][tj]++;

    queue<pair<int, int>> q;
    FOR (i, 1, n) FOR (j, 1, m) if (deg[i][j] == 0) q.emplace(i, j);
    while (q.size()) {
        auto [i, j] = q.front();
        q.pop();
        ans[i][j] = ++sz;
        for (auto [ti, tj] : adj[i][j]) if (--deg[ti][tj] == 0) q.emplace(ti, tj);
    }
    FOR (i, 1, n) FOR (j, 1, m) cout << ans[i][j] << " \n"[j == m];
}

int main() {
    Waimai;
    solve();
}