#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;

#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REPS(i,x) for(int i=1;i<=(int)(x);i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define RREPS(i,x) for(int i=((int)(x));i>0;i--)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)
#define ALL(container) (container).begin(), (container).end()
#define RALL(container) (container).rbegin(), (container).rend()
#define mp(a,b) make_pair(a, b)
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define __builtin_popcount __builtin_popcountll
//#define endl '\n'

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
    os<<"["; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"]"; return os;
}
template<class T> ostream& operator<<(ostream &os, const set<T> &t) {
    os<<"{"; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"}"; return os;
}
template<class S, class T> ostream& operator<<(ostream &os, const map<S, T> &t) {
    os<<"{"; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"}"; return os;
}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first+t.first, s.second+t.second);}
template<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first-t.first, s.second-t.second);}

const int INF = 1<<28;
const double EPS = 1e-8;
const int MOD = 1000000007;


int T, n, m, k;

int used = 0;
vector<string> s;
vector<vector<int>> ans;
void fill(int sx, int sy, int tx, int ty) {
    int c = 0;
    map<int, int> mp;
    for(int i=sy;i<ty;i++) {
        for(int j=sx;j<tx;j++) {
            if (s[i][j] == '#') c ++;
        }
        if(c != 0) mp[c] = i + 1;
    }
    if (c == 1) {
        ++ used;
        for(int i=sy;i<ty;i++) {
            for(int j=sx;j<tx;j++) {
                ans[i][j] = used;
            }
        }
    } else {
        if (mp.size() > 1) {
            int p = mp.begin()->second;
            fill(sx, sy, tx, p);
            fill(sx, p, tx, ty);
        } else {
            int c = 0;
            for(int j=sx;j<tx;j++) {
                for(int i=sy;i<ty;i++) {
                    if (s[i][j] == '#') c ++;
                }
                if(c != 0) {
                    fill(sx, sy, j + 1, ty);
                    fill(j + 1, sy, tx, ty);
                    return;
                }
            }
        }
    }
}

int main(int argc, char *argv[]){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    while(cin >> n >> m >> k){
        used = 0;
        s = vector<string>(n);
        ans = vector<vi>(n, vi(m));
        REP(i, n) cin >> s[i];
        fill(0, 0, m, n);
        REP(i, n) {
            REP(j, m) cout << ans[i][j] << " \n"[j + 1 == m];
        }
    }
    return 0;
}


Measured memory_bytes: 3456