constexpr bool isDebugMode = true;
int testcase = 1;
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
    #include <atcoder/all>
    using namespace atcoder;
#endif
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
struct edge{long long to,cost;};
const int inf = 1 << 27;
const long long INF = 1LL << 60;
const int COMBMAX = 1001001;
const long long MOD = 1000000007;
const long long dy[] = {-1, 0, 0, 1};
const long long dx[] = {0, -1, 1, 0};
string abc = "abcdefghijklmnopqrstuvwxyz";
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define eachdo(v, e) for (const auto &e : (v))
#define all(v) (v).begin(), (v).end()
#define lower_index(v, e) (long long)distance((v).begin(), lower_bound((v).begin(), (v).end(), e))
#define upper_index(v, e) (long long)distance((v).begin(), upper_bound((v).begin(), (v).end(), e))
long long mpow(long long a, long long n, long long mod = MOD){long long res = 1; while(n > 0){if(n & 1)res = res * a % mod; a = a * a % mod; n >>= 1;} return res;}
void pt(){cout << endl; return;}
template<class Head> void pt(Head&& head){cout << head; pt(); return;}
template<class Head, class... Tail> void pt(Head&& head, Tail&&... tail){cout << head << " "; pt(forward<Tail>(tail)...);}
void dpt(){if(!isDebugMode) return; cout << endl; return;}
template<class Head> void dpt(Head&& head){if(!isDebugMode) return; cout << head; pt(); return;}
template<class Head, class... Tail> void dpt(Head&& head, Tail&&... tail){if(!isDebugMode) return; cout << head << " "; pt(forward<Tail>(tail)...);}
template<class T> void debug(T v){if(!isDebugMode) return; rep(i, v.size()) cout << v[i] << " " ; cout << endl;}
template<class T> void debug2(T v){if(!isDebugMode) return; rep(i, v.size()){rep(j, v[i].size()) cout << v[i][j] << " " ; cout << endl;}}
template<class T1, class T2> inline bool chmin(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}
template<class T1, class T2> inline bool chmax(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}
template<class T1, class T2> long long recgcd(T1 a, T2 b){return a % b ? recgcd(b , a % b) : b;}
bool valid(long long H, long long W, long long h, long long w) { return 0 <= h && h < H && 0 <= w && w < W; }

void solve();

int main(){
    while(testcase--) solve();
    return 0;
}

ll counter = 0;
void dfs_w(vector<string> &S, vector<vector<ll>> &ans, ll h0, ll h1, ll W){
    vector<ll> exi;
    rep(i, W){
        for(ll j = h0; j < h1; j++){
            if(S[j][i] == '#'){
                exi.push_back(i);
                break;
            }
        }
    }
    exi.push_back(W);
    ll tail = 0;
    for(ll k = 1; k < exi.size(); k++){
        counter++;
        for(ll i = h0; i < h1; i++)for(ll j = tail; j < exi[k]; j++){
            ans[i][j] = counter;
        }
        tail = exi[k];
    }
}

void dfs_h(vector<string> &S, vector<vector<ll>> &ans, ll h0, ll h1, ll W){
    vector<ll> exi;
    for(ll i = h0; i < h1; i++){
        rep(j, W){
            if(S[i][j] == '#'){
                exi.push_back(i);
                break;
            }
        }
    }
    // debug(exi);
    exi.push_back(h1);
    ll tail = 0;
    for(ll i = 1; i < exi.size(); i++){
        dfs_w(S, ans, tail, exi[i], W);
        tail = exi[i];
    }
}

void solve(){
    ll H, W, K; cin >> H >> W >> K;
    vector<string> S(H);
    rep(i, H) cin >> S[i];
    vector<vector<ll>> ans(H, vector<ll>(W, -1));
    dfs_h(S, ans, 0, H, W);
    debug2(ans);
    return;
}

Measured memory_bytes: 5220