#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
using namespace std;
long long dx[] = {1, 0, -1, 0};
long long dy[] = {0, 1, 0, -1};
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T &x) {
  long long f = 0;
  cerr << '{';
  for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
void solve() {
  long long n, m, k;
  cin >> n >> m >> k;
  long long s = 0;
  vector<vector<char>> v(n, vector<char>(m));
  vector<vector<long long>> vis(n, vector<long long>(m, 0));
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < m; j++) {
      cin >> v[i][j];
      if (v[i][j] == '#')
        vis[i][j] = 1;
      else
        s++;
    }
  }
  long long cnt = 1;
  queue<tuple<long long, long long>> q;
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < m; j++) {
      if (v[i][j] != '#') {
        q.push({i, j});
        vis[i][j] = 1;
        i = n, j = m;
      }
    }
  }
  while (!q.empty()) {
    if (cnt == s - k) break;
    tuple<long long, long long> tup = q.front();
    q.pop();
    for (long long dir = 0; dir < 4; dir++) {
      long long x = get<0>(tup) + dx[dir];
      long long y = get<1>(tup) + dy[dir];
      if (x < 0 || y < 0 || x >= n || y >= m || v[x][y] == '#' || vis[x][y])
        continue;
      vis[x][y] = 1;
      q.push({x, y});
      cnt++;
      if (cnt == s - k) break;
    }
  }
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < m; j++) {
      if (!vis[i][j])
        cout << 'X';
      else
        cout << v[i][j];
    }
    cout << "\n";
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
  return 0;
}
