#include <bits/stdc++.h>
#define range(i, l, r) for(long long int (i) = (l); (i) < (r); (i)++)
#define reversed_range(i, l, r) for (long long int (i) = (r) - 1; (i) >= l; (i)--)
using namespace std;
template <typename T>
using vec = vector<T>;
using lint = long long;
using ulint = unsigned long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;

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

template <typename T>
ostream& operator <<(ostream& os, vec<T> v) {
    if (v.size() == 0) return os;
    for (int i = 0; i < v.size() - 1; i++) {
        os << v.at(i) << " ";
    }
    return os << v.at(v.size() - 1);
}

template <typename T>
ostream& operator <<(ostream& os, set<T>& s) {
    os << "{";
    if (s.begin() == s.end()) return os << "}";
    auto it_first_item = s.begin();
    cout << *it_first_item;
    for (auto it = ++it_first_item; it != s.end(); it++) {
        cout << ", " << *it;
    }
    return cout << "}";
}

template <typename T>
ostream& operator <<(ostream& os, unordered_set<T>& s) {
    os << "{";
    if (s.begin() == s.end()) return os << "}";
    auto it_first_item = s.begin();
    cout << *it_first_item;
    for (auto it = ++it_first_item; it != s.end(); it++) {
        cout << ", " << *it;
    }
    return cout << "}";
}

template <typename K, typename V>
ostream& operator <<(ostream& os, map<K, V> m) {
    os << "{";
    if (m.begin() == m.end()) return os << "}";
    auto it_first_item = m.begin();
    cout << it_first_item->first << ": " << it_first_item->second;
    for (auto it = ++it_first_item; it != m.end(); it++) {
        cout << ", " << it->first << ": " << it->second;
    }
    return os << "}";
}

template <typename K, typename V>
ostream& operator <<(ostream& os, unordered_map<K, V> m) {
    os << "{";
    if (m.begin() == m.end()) return os << "}";
    auto it_first_item = m.begin();
    cout << it_first_item->first << ": " << it_first_item->second;
    for (auto it = ++it_first_item; it != m.end(); it++) {
        cout << ", " << it->first << ": " << it->second;
    }
    return os << "}";
}

lint pow(lint num, lint e, lint MOD) {
    lint res = 1;
    lint cur_num = num;
    while (e) {
        if (e & 1) {
            res *= cur_num;
            res %= MOD;
        }
        cur_num *= cur_num;
        cur_num %= MOD;
        e >>= 1;
    }
    return res;
}

int main() {
    cin.tie(0); cout.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    lint H, W, K; cin >> H >> W >> K;
    vec<string> grid(H);
    range(i, 0, H) cin >> grid.at(i);
    vec<vec<lint>> assignment(H, vec<lint>(W, -1));
    vec<lint> col_target_existing;
    range(j, 0, W) {
        range(i, 0, H) if (grid.at(i).at(j) == '#') {
            col_target_existing.emplace_back(j);
            break;
        }
    }
    lint cur_idx = 1;
    for (const auto j : col_target_existing) {
        bool first_target_visited = false;
        range(i, 0, H) {
            if (grid.at(i).at(j) == '#') {
                if (first_target_visited) cur_idx += 1;
                else first_target_visited = true;
            }
            assignment.at(i).at(j) = cur_idx;
        }
        cur_idx += 1;
    }
    vec<lint> col_non_target;
    range(j, 0, W) {
        bool flag = true;
        range(i, 0, H) if (grid.at(i).at(j) == '#') {
            flag = false;
            break;
        }
        if (flag) col_non_target.emplace_back(j);
    }
    for (const lint j : col_non_target) {
        lint closest_idx;
        auto it = lower_bound(col_target_existing.begin(), col_target_existing.end(), j);
        if (it != col_target_existing.end()) {
            closest_idx = *it;
            range(i, 0, H) assignment.at(i).at(j) = assignment.at(i).at(closest_idx);
        } else {
            it--;
            closest_idx = *it;
            range(i, 0, H) assignment.at(i).at(j) = assignment.at(i).at(closest_idx);
        }
    }
    range(i, 0, H) cout << assignment.at(i) << "\n";
}

Measured memory_bytes: 1664