//#define NDEBUG
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <vector>

namespace n91 {

  using i8 = std::int_fast8_t;
  using i32 = std::int_fast32_t;
  using i64 = std::int_fast64_t;
  using u8 = std::uint_fast8_t;
  using u32 = std::uint_fast32_t;
  using u64 = std::uint_fast64_t;
  using isize = std::ptrdiff_t;
  using usize = std::size_t;

  struct rep {
    struct itr {
      usize i;
      constexpr itr(const usize i) noexcept : i(i) {}
      void operator++() noexcept { ++i; }
      constexpr usize operator*() const noexcept { return i; }
      constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
    };
    const itr f, l;
    constexpr rep(const usize f, const usize l) noexcept
      : f(std::min(f, l)), l(l) {}
    constexpr auto begin() const noexcept { return f; }
    constexpr auto end() const noexcept { return l; }
  };
  struct revrep {
    struct itr {
      usize i;
      constexpr itr(const usize i) noexcept : i(i) {}
      void operator++() noexcept { --i; }
      constexpr usize operator*() const noexcept { return i; }
      constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
    };
    const itr f, l;
    constexpr revrep(const usize f, const usize l) noexcept
      : f(l - 1), l(std::min(f, l) - 1) {}
    constexpr auto begin() const noexcept { return f; }
    constexpr auto end() const noexcept { return l; }
  };
  template <class T> auto md_vec(const usize n, const T& value) {
    return std::vector<T>(n, value);
  }
  template <class... Args> auto md_vec(const usize n, Args... args) {
    return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
  }
  template <class T> constexpr T difference(const T& a, const T& b) noexcept {
    return a < b ? b - a : a - b;
  }
  template <class T> void chmin(T& a, const T& b) noexcept {
    if (b < a)
      a = b;
  }
  template <class T> void chmax(T& a, const T& b) noexcept {
    if (a < b)
      a = b;
  }
  template <class T> T scan() {
    T ret;
    std::cin >> ret;
    return ret;
  }

} // namespace n91

#include <algorithm>
#include <iostream>
#include <numeric>
#include <utility>

namespace n91 {

  void main_() {
    /*
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    //*/
    const usize h = scan<usize>();
    const usize w = scan<usize>();
    const usize k = scan<usize>();
    auto s = md_vec(h, w, char());
    auto ans = md_vec(h, w, usize());
    for (auto& v : s) {
      for (auto& e : v) {
        std::cin >> e;
      }
    }
    std::vector<bool> sph(h + 1, false);
    {usize sum = 0;
    for (const usize i : rep(0, h)) {
      usize cnt = std::count(s[i].cbegin(), s[i].cend(), '#');
      sum += cnt;
      if (cnt != 0 && sum != k) {
        sph[i + 1] = true;
      }
    }
    sph[h] = true;
  }
    {
      usize ord = 1;
      usize low = 0, high;
      while (low != h) {
        high = low + 1;
        while (!sph[high]) {
          high += 1;
        }
        usize t = 0;
        for (const usize i : rep(low, high)) {
          t += std::count(s[i].cbegin(), s[i].cend(), '#');
        }
        usize sum = 0;
        for (const usize i : rep(0, w)) {
          usize cnt = 0;
          for (const usize j : rep(low, high)) {
            if (s[j][i] == '#') {
              cnt += 1;
            }
            ans[j][i] = ord;
          }
          sum += cnt;
          if (cnt != 0 && sum != t) {
            ord += 1;
          }
        }
        ord += 1;
        low = high;
      }
    }
    for (const auto& v : ans) {
      for (const usize i : rep(0, w)) {
        if (i) {
          std::cout << ' ';
        }
        std::cout << v[i];
      }
      std::cout << std::endl;
    }
  }

} // namespace n91

int main() {
  n91::main_();
  return 0;
}


Measured memory_bytes: 1536