// May this submission get accepted!

#pragma GCC optimize ("O3")
#pragma GCC target ("tune=native")
#pragma GCC target ("avx")

#include <bits/stdc++.h>

// 汎用マクロ
#define ALL_OF(x) (x).begin(), (x).end()
#define REP(i,n) for (long long i=0, i##_len=(n); i<i##_len; i++)
#define RANGE(i,is,ie) for (long long i=(is), i##_end=(ie); i<=i##_end; i++)
#define DSRNG(i,is,ie) for (long long i=(is), i##_end=(ie); i>=i##_end; i--)
#define STEP(i, is, ie, step) for (long long i=(is), i##_end=(ie), i##_step = (step); i<=i##_end; i+=i##_step)
#define UNIQUE(v) do { sort((v).begin(), (v).end()); (v).erase(unique((v).begin(), (v).end()), (v).end()); } while (false)
template<class T> bool chmax(T &a, const T &b) { if (a < b) {a = b; return true;} return false; }
template<class T> bool chmin(T &a, const T &b) { if (a > b) {a = b; return true;} return false; }
#define INF 0x7FFFFFFF
#define LINF 0x7FFFFFFFFFFFFFFFLL
#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")
#define DUMP(q) cerr << "[DEBUG] " #q ": " << (q) << " at " __FILE__ ":" << __LINE__ << endl
#define DUMPALL(q) do { cerr << "[DEBUG] " #q ": ["; REP(DUMPALL_ITR, (q).size()) { cerr << (q)[DUMPALL_ITR] << (DUMPALL_ITR == DUMPALL_ITR_len-1 ? "" : ", "); } cerr << "] at " __FILE__ ":" << __LINE__ << endl; } while (false)
template<class T> T gcd(T a, T b) { if (a < b) std::swap(a, b); while (b) std::swap(a %= b, b); return a; }
template<class T> T lcm(const T a, const T b) { return a / gcd(a, b) * b; }

// gcc拡張マクロ
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll

// エイリアス
#define DANCE_ long
#define ROBOT_ unsigned
#define HUMAN_ signed
using  ll = DANCE_ HUMAN_ DANCE_;
using ull = DANCE_ ROBOT_ DANCE_;
using  ld = long double;
using namespace std;

// モジュール


// 処理内容
int main() {
    
    // インタラクティブ問題では除去した方がいいかも
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    ll h, w, k; cin >> h >> w >> k;
    vector<string> s(h);
    REP(i, h) cin >> s[i];

    vector<bool> has_itigo(h, false);
    REP(i, h) REP(j, w) if (s[i][j] == '#') has_itigo[i] = true;

    vector<vector<ll>> ans(h, vector<ll>(w, -1));
    ll icnt = 0;
    REP(i, h) {
        if (has_itigo[i]) {
            vector<ll> itigo_list; itigo_list.reserve(w);
            REP(j, w) {
                if (s[i][j] == '#') {
                    itigo_list.push_back(j);
                }
            }
            ll jn = 0;
            for (ll jf : itigo_list) {
                icnt++;
                while (jn <= jf) {
                    ans[i][jn] = icnt;
                    jn++;
                }
            }
            RANGE(j, itigo_list.back(), w-1) {
                ans[i][j] = icnt;
            }
        }
    }

    RANGE(i, 1, h-1) {
        if (!has_itigo[i] && has_itigo[i-1]) {
            ans[i] = ans[i-1];
            has_itigo[i] = true;
        }
    }
    DSRNG(i, h-2, 0) {
        if (!has_itigo[i] && has_itigo[i+1]) {
            ans[i] = ans[i+1];
            has_itigo[i] = true;
        }
    }

    

    REP(i, h) REP(j, w) {
        cout << ans[i][j] << " \n"[j == j_len - 1];
    }
    
}

Measured memory_bytes: 1664