#include<bits/stdc++.h>
using namespace std;
/*******  All Required define Pre-Processors and typedef Constants *******/
#define rep(i,n) for(int i=0; i<(n); ++i)
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.rbegin(), cont.rend()
#define Dcout(a) cout << setprecision(20) << a << endl
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vll vector<ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define fi first
#define se second
using Graph = vector<vector<ll>>;
// const ll INF = (1LL << 60);
const double pi=acos(-1.0);
/******************* debug ********************/
#define debug(var)  do{std::cout << #var << " : ";view(var);}while(0)
#define deb cout << "line : " << __LINE__ << " debug" << endl
template<typename T> void view(T e){cout << e << endl;}
template<typename T> void view(const vector<T>& v){
    for(const auto& e : v) cout << e << " ";
    cout << endl;}
template<typename T> void view(const vector<vector<T> >& vv){
    for(const auto& v : vv){ view(v); }}
/****** Template of some basic operations *****/
struct IoSetup {
    IoSetup() {
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(10);
        cerr << fixed << setprecision(10);
        }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 >& p) {
    os << p.first << " " << p.second;
    return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
    is >> p.first >> p.second;
    return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
    for(int i = 0; i < (int) v.size(); i++) {
        os << v[i] << (i + 1 != v.size() ? " " : "");
    }
    return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
    for(T &in : v) is >> in;
    return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = ll >
vector< T > make_v(size_t a) {
    return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
    return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
    t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
    for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
    FixPoint(F &&f) : F(forward< F >(f)) {}

    template< typename... Args >
    decltype(auto) operator()(Args &&... args) const {
        return F::operator()(*this, forward< Args >(args)...);
    }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
    return FixPoint< F >{forward< F >(f)};
}
/*******************************************************/
/******************** Start coding ! *******************/
int h,w,k,a[309][309], num;
int cnt[309];
char c[309][309];

void solve(int cl, int cr){
    vector<int> P;
    for(int i=cl; i<=cr; i++){
        for(int j=1; j<=w; j++){
            if(c[i][j]=='#') P.push_back(j);
        }
    }
    sort(all(P));

    for(int i=0; i<P.size(); i++){
        //切るところを考える
        int v1 = 1, v2 = w;
        //前のところの次から
        if(i>=1) v1 = P[i-1] + 1;
        //そこまで
        if(i < (int)P.size() -1) v2 = P[i];

        num++;
        for(int j=cl; j<=cr; j++){
            for(int k=v1; k<=v2; k++) a[j][k] = num;
        }
    }
}

int main(){
    cin >> h >> w >> k;
    for(int i=1; i<=h; i++){
        for(int j=1; j<=w; j++){
            cin >> c[i][j];
            if(c[i][j]=='#') cnt[i]++;
        }
    }

    vector<int> vec;
    for(int i=1; i<=h; i++) {if(cnt[i] >= 1) vec.push_back(i);}
    //イチゴがある行にだけ
    for(int i = 0; i < vec.size(); i++){
        int v1 = 1, v2 = h;
        //最初の場合は始まる行v1を1からそうでないなら(前の行+1)から
        if(i>=1) v1 = vec[i-1] + 1;
        //最後の行は一番最後までチェックする必要があるためv2=hにする
        //それ以外はその行でいい
        if(i < (int)vec.size() - 1) v2 = vec[i];

        solve(v1, v2);
    }

    for(int i=1; i<=h; i++){
        for(int j=1; j<=w; j++){
            if(j>=2) cout << " "; cout << a[i][j];
        }
        cout << endl;
    }
}



Measured memory_bytes: 4132