#include <bits/stdc++.h>
#define sort_(a) sort(a.begin(), a.end())
#define rsort(a) sort(a.rbegin(), a.rend())
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; 0 <= i; i--)
#define for_(i, start, end) for (int i = start; i < end; i++)
#define rfor(i, start, end) for (int i = start - 1; 0 <= i; i--)
#define all(a) a.begin(), a.end()
using ll = long long;
using ld = long double;
using namespace std;
constexpr int INF32       = 1'050'000'000;
constexpr long long INF64 = 4'000'000'000'000'000'000;
constexpr int MOD7        = 1'000'000'007;
constexpr int MOD53       = 998'244'353;
constexpr double PI       = 3.14159265358979323846;
template <class T> inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T> inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
void print() { std::cout << '\n'; }
template <class H, class... T> void print(H &&head, T &&... args) {
    std::cout << head;
    sizeof...(args) == 0 ? std::cout << "" : std::cout << ' ';
    print(std::forward<T>(args)...);
}
template <class T> void print(std::vector<T> &v) {
    for (int i = 0; i < v.size(); i++) {
        std::cout << v[i];
        i == v.size() - 1 ? std::cout << '\n' : std::cout << ' ';
    }
}
template <class T> void print(std::vector<std::vector<T>> &v) {
    for (int i = 0; i < v.size(); i++) {
        for (int j = 0; j < v[i].size(); j++) {
            std::cout << v[i][j];
            j == v[i].size() - 1 ? std::cout << '\n' : std::cout << ' ';
        }
    }
}
void scan() {}
template <class H, class... T> void scan(H &&head, T &&... args) {
    std::cin >> head;
    scan(std::forward<T>(args)...);
}
template <class T> void scan(std::vector<T> &v) {
    for (auto &&i : v) {
        scan(i);
    }
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int H, W, K;
    scan(H, W, K);
    vector<vector<char>> s(H, vector<char>(W));
    scan(s);

    vector<vector<int>> ans(H, vector<int>(W));
    int now = 1;
    rep(y, H) {
        bool f = false;
        rep(x, W) {
            if (!f) {
                ans[y][x] = now;
            }
            if (s[y][x] == '#' && !f) {
                ans[y][x] = now;
                f         = true;
            } else if (s[y][x] == '#') {
                ans[y][x] = ++now;
            } else {
                ans[y][x] = now;
            }
        }
        if (!f) {
            rep(x, W) ans[y][x] = 0;
        } else
            now++;
    }
    rep(y, H) {
        rep(x, W) {
            if (ans[y][x] == 0) {
                if (0 <= y - 1 && ans[y - 1][x]) {
                    ans[y][x] = ans[y - 1][x];
                } else if (y + 1 < H && ans[y + 1][x]) {
                    ans[y][x] = ans[y + 1][x];
                }
            }
        }
    }
    rrep(y, H) {
        rep(x, W) {
            if (ans[y][x] == 0) {
                if (0 <= y - 1 && ans[y - 1][x]) {
                    ans[y][x] = ans[y - 1][x];
                } else if (y + 1 < H && ans[y + 1][x]) {
                    ans[y][x] = ans[y + 1][x];
                }
            }
        }
    }
    print(ans);

    return 0;
}

Measured memory_bytes: 1280