//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
 
#include <iostream>
#include <stdlib.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <assert.h>
#include <memory.h>
#include <time.h>
#include <bitset>
 
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define ld long double
#define rep(i, l, r) for (int i = (l); i < (r); i++)
#define repb(i, r, l) for (int i = (r); i > (l); i--)
#define sz(a) (int)a.size()
#define fi first
#define se second
#define mp(a, b) make_pair(a, b)
#define rank qwertyuio
#define next dfghjk
#define plus fsghsf
#define minus ytryr
 
using namespace std;
 
inline bool setmin(int &x, int y) { return (y < x) ? x = y, 1 : 0; }
inline bool setmax(int &x, int y) { return (y > x) ? x = y, 1 : 0; }
inline bool setmin(ll &x, ll y) { return (y < x) ? x = y, 1 : 0; }
inline bool setmax(ll &x, ll y) { return (y > x) ? x = y, 1 : 0; }
 
const int N = 300;
const int inf = (int)1e9 + 1;
const ll big = (ll)1e18 + 1;
const int P = 239;
const int P1 = 31;
const int P2 = 57;
const int MOD = (int)1e9 + 7;
const int MOD1 = (int)1e9 + 9;
const int MOD2 = 998244353;
const ld eps = 1e-12;
const double pi = atan2(0, -1);
const int ABC = 26;

string a[N];
int ans[N][N];

int main()
{
    //freopen("a.in", "r", stdin);
    //freopen("a.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.precision(20);
    //ll TL = 10.95 * CLOCKS_PER_SEC;
    //clock_t time = clock();
    int n, m, k;
    cin >> n >> m >> k;
    rep(i, 0, n) {
        cin >> a[i];
    }
    int last = 0, cur = 1;
    rep(i, 0, n) {
        bool ok = false;
        if (i == n - 1) {
            ok = true;
        }
        rep(j, 0, m) {
            if (a[i][j] == '#') {
                ok = true;
            }
        }
        if (ok) {
            while (i + 1 < n) {
                bool ooo = false;
                rep(j, 0, m) {
                    if (a[i + 1][j] == '#') {
                        ooo = true;
                    }
                }
                if (ooo) {
                    break;
                } else {
                    i++;
                }
            }
            int last1 = 0;
            rep(j, 0, m) {
                bool ok1 = false;
                if (j == m - 1) {
                    ok1 = true;
                }
                rep(s, last, i + 1) {
                    if (a[s][j] == '#') {
                        ok1 = true;
                    }
                }
                if (ok1) {
                    while (j + 1 < m) {
                        bool ooo = false;
                        rep(s, last, i + 1) {
                            if (a[s][j + 1] == '#') {
                                ooo = true;
                            }
                        }
                        if (ooo) {
                            break;
                        } else {
                            j++;
                        }
                    }
                    rep(s, last, i + 1) {
                        rep(t, last1, j + 1) {
                            ans[s][t] = cur;
                        }
                    }
                    cur++;
                    last1 = j + 1;
                }
            }
            last = i + 1;
        }
    }
    rep(i, 0, n) {
        rep(j, 0, m) {
            cout << ans[i][j] << " ";
        }
        cout << "\n";
    }
    return 0;
}

Measured memory_bytes: 1280