#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long int> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long int>> vvl;
typedef pair<int, int> pii;
typedef pair<long long int, long long int> pll;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long int, long long int>> vll;
#define fast() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define test() long long int t; cin >> t; cin.ignore(); while(t--) 
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define mp make_pair
#define MOD 1000000007
#define SMOD 998244353
#define pq priority_queue
#define all(x) x.begin(),x.end()
#define SP(x) setprecision(x)
#define sp " "
#define inp(a) ll a;cin>>a;cin.ignore()
#define inps(a,b) ll a,b;cin>>a>>b;cin.ignore()
#define out(a) cout<<SP(20)<<a<<'\n'
#define outs(a,b) cout<<SP(20)<<a<<" "<<b<<'\n'
#define ins insert
#define er erase
#define lb lower_bound
#define ub upper_bound
#define printclock cerr<<"Time : "<<1000*(ld)clock()/(ld)CLOCKS_PER_SEC<<"ms\n";
#define inpa(a,n) ll a[n]; for(int i=0; i<n; i++){cin>>a[i];}
#define inpv(a,n) vl a; for(int i=0; i<n; i++){inp(x);a.pb(x);}
#define outa(a,n) for(int i=0;i<n;i++){cout<<a[i]<<" ";}cout<<'\n';
#define outv(v) for(auto i:v){cout<<i<<" ";}cout<<'\n';
set<char> vow = {'a','e','i','o','u','A','E','I','O','U'};
ll xpow(ll n, ll m){if(m==0){return 1;}else{ll x = xpow(n, m/2);if(m&1){return x*x*n;}else{return x*x;}}}
ll xmod(ll a, ll m){return (((a%m)+m)%m);}
ll xmodpow(ll n, ll m, ll y){if(m==0){return 1;}else{ll x = xmodpow(n, m/2, y);if(m&1){return xmod((xmod((xmod(x,y)*xmod(x,y)),y)*xmod(n,y)),y);}else{return xmod((xmod(x,y)*xmod(x,y)),y);}}}

int main(){
    fast();
 
/* you get what you work for not what you wish for */
    
    ll r, c;
    cin >> r >> c;
    ll k;
    cin >> k;
    ll a[r+5][c+5];
    memset(a, 0, sizeof a);
    for(int i=1; i<=r; i++){
        string s;
        cin >> s;
        for(int j=1; j<=c; j++){
            if(s[j-1]=='#'){
                a[i][j] = 1;
            }
        }
    }
    set <ll> empty, have;
    for(int i=1; i<=r; i++){
        bool check = 0;
        for(int j=1; j<=c; j++){
            if(a[i][j]){
                check = 1;
            }
        }
        if(!check){
            empty.ins(i);
        }
        else{
            have.ins(i);
        }
    }
    ll curr = 0;
    ll ans[r+5][c+5];
    for(int i=1; i<=r; i++){
        if(empty.find(i)==empty.end()){
            curr++;
            ll cnt = 0;
            ll pre = 1;
            for(int j=1; j<=c; j++){
                if(a[i][j]){
                    cnt++;
                    if(cnt>pre){
                        pre = cnt;
                        curr++;
                    }
                    ans[i][j] = curr;
                }
                else{
                    ans[i][j] = curr;
                }
            }
        }
    }
    for(int i=1; i<=r; i++){
        if(empty.find(i)!=empty.end()){
            auto k = have.lb(i);
            if(k==have.end()){
                for(int j=1; j<=c; j++){
                    ans[i][j] = ans[i-1][j];
                }
            }
            else{
                int row = *k;
                for(int j=1; j<=c; j++){
                    ans[i][j] = ans[row][j];
                }
            }
        }
    }
    for(int i=1; i<=r; i++){
        for(int j=1; j<=c; j++){
            cout << ans[i][j] << " ";
        }
        cout << endl;
    }
}

Measured memory_bytes: 2304