/* 
 Author:N_o_o_B 
 Created:November 23 2019 17:41:50
*/
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define TRACE
#ifdef TRACE
#define trace(...) { cerr<<"[ "; __trace__(#__VA_ARGS__, __VA_ARGS__);}
#undef endl
template <typename Arg1,typename Arg2>
ostream& operator << (ostream& out, const pair<Arg1,Arg2> &x) {
    return out<<"("<<x.first<<","<<x.second<<")";
}
 
template <typename Arg1>
ostream& operator << (ostream& out, const vector<Arg1> &a) {
    out<<"[";for(const auto &x:a)out<<x<<",";return out<<"]";
}
 
template <typename Arg1>
ostream& operator << (ostream& out, const set<Arg1> &a) {
    out<<"[";for(const auto &x:a)out<<x<<",";return out<<"]";
}
 
template <typename Arg1,typename Arg2>
ostream& operator << (ostream& out, const map<Arg1,Arg2> &a) {
    out<<"[";for(const auto &x:a)out<<x<<",";return out<<"]";
}
 
template <typename Arg1>
void __trace__(const string name, Arg1&& arg1){
    cerr << name << " : " << arg1 << " ] " << endl;
}
 
template <typename Arg1, typename... Args>
void __trace__(const string names, Arg1&& arg1, Args&&... args){
    const string name = names.substr(0,names.find(','));
    cerr<<name<<" : "<<arg1<<" | ";
    __trace__(names.substr(1+(int)name.size()), args...);
}
#else
    #define trace(args...)
#endif
 
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pair<int,int>> vii;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<pair<ll,ll>> vll;
typedef vector<vl> vvl;
typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> oset;
#define fori(i,n) for(int i=0;i<n;i++)
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define repd(i,a,b) for(int i=a;i>=b;i--)
#define ford(i,n)  for(int i=n-1;i>=0;i--)
#define all(x) x.begin(),x.end()
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define fi first
#define se second
clock_t time_p=clock();
void time_taken()
{
    time_p=clock()-time_p;
    cerr<<"Time Taken : "<<(float)(time_p)/CLOCKS_PER_SEC<<"\n";
}
//const ll mod=998244353;
const ll mod=1e9+7;
const ll INF=1e18;
vvi ans(301,vi(301));
int n,m;
void dfs(int x,int y){
    for(int i=x-1;i>=0 and ans[i][y]==0;i--){
        ans[i][y] = ans[x][y];
    }
    for(int i=x+1;i<n and ans[i][y]==0;i++){
        ans[i][y] = ans[x][y];
    }
}
bitset<300> vis;
void dfs2(int col){
    if(vis[col]) return;
    vis[col]=1;
    if(col-1>=0 and ans[0][col-1]==0){
        fori(i,n){
            ans[i][col-1]=ans[i][col];
        }
        dfs2(col-1);
    }
    if(col+1 < m and ans[0][col+1]==0){
        fori(i,n){
            ans[i][col+1]=ans[i][col];
        }
        dfs2(col+1);
    }
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    cout.precision(12);cout << fixed;
    int k;
    cin >> n >> m >> k;
    vector<string> a(n);
    fori(i,n) cin >> a[i];
    int cur = 1;
    fori(i,n){
        fori(j,m){
            if(a[i][j]=='#') ans[i][j]=cur++;
        }
    }
    fori(i,n){
        fori(j,m){
            if(a[i][j]=='#') dfs(i,j);
        }
    }
    vis.reset();
    fori(j,m){
        if(ans[0][j]!=0){
            dfs2(j);
        }
    }
    fori(i,n){
        fori(j,m){
            cout << ans[i][j] << " ";
        }
        cout << endl;
    }
    time_taken();
    return 0;
}

Measured memory_bytes: 1280