#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;

// tourist set
template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}

template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << '\n'; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
// tourist set end

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 (b<a) { a=b; return 1; } return 0; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,b) FOR(i, 0, b)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<'\n'
#define p2(s, t) cout << (s) << " " << (t) << '\n'
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << '\n'
#define p_yes() p("YES")
#define p_no() p("NO")
#define SZ(x) ((int)(x).size())
#define SORT(A) sort(ALL(A))
#define RSORT(A) sort(ALL(A), greater<ll>())

void no(){p_no(); exit(0);}
void yes(){p_yes(); exit(0);}

const ll mod = 1e9 + 7;
const ll inf = 1e18;
const double PI = acos(-1);

ll Ans[310][310];
ll color;

ll H,W,K;

void fillLeftUpper(ll y, ll x){
  color++;
  // debug("fill by", color);
  for(int i=y; i>=0; i--){
    if(Ans[i][x]!=0){
      // debug(i, "break", color);
      break;
    }
    Ans[i][x] = color;
    // 左に塗る
    for(int j=x-1; j>=0; j--){
      // debug(i, j, Ans[i][j]);
      if(Ans[i][j]!=0) break;
      Ans[i][j] = color;
    }
  }
}

void fillRightUpper(ll y, ll x){
  color = Ans[y][x];

  // debug("fill by", color);
  Ans[y][x] = color;
  for(int i=y; i>=0; i--){
    if(Ans[i][x]!=color){
      // debug(i, "break", color);
      break;
    }
    Ans[i][x] = color;
    // 左に塗る
    for(int j=x+1; j<W; j++){
      // debug(i, j, Ans[i][j]);
      if(Ans[i][j]!=0) break;
      Ans[i][j] = color;
    }
  }
}

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

    // input
    cin >> H>>W>>K;

    VS S(H);
    rep(i, H){
      cin >> S[i];
    }

    stringstream ss;
    rep(i, W) ss << '.';
    string no_ichigo = ss.str();

    ll last_ichigo_row = -1;
    rep(i, H){
      if(S[i]==no_ichigo) continue;
      last_ichigo_row = i;

      rep(j, W){
        if(S[i][j]=='#') fillLeftUpper(i, j);
      }
      for(int j=W-1; j>=0; j--){
        if(S[i][j]=='#'){
          fillRightUpper(i, j);
          break;
        }
      }
    }
    // 下の空白を埋める
    FOR(i, last_ichigo_row, H-1){
      rep(j, W){
        Ans[i+1][j] = Ans[i][j];
      }
    }

    rep(i, H){
      rep(j, W){
        cout << Ans[i][j] << ' ';
      }
      cout << endl;
    }

    
    return 0;
}

Measured memory_bytes: 1664