#include <bits/stdc++.h>
using namespace std;
bool sortinrev(const pair<int, int> &a, const pair<int, int> &b) {
  return (a.first > b.first);
}
struct greaterr {
  template <class T>
  bool operator()(T const &a, T const &b) const {
    return a > b;
  }
};
vector<int> adj[251001];
bool visited[251001];
string ss[501];
int total, k, n, m;
void dfs(int x) {
  if (total <= k) return;
  total--;
  visited[x] = true;
  for (auto &i : adj[x]) {
    if (visited[i] == false) {
      dfs(i);
    }
  }
}
int main() {
  std::ios::sync_with_stdio(false);
  cin >> n >> m >> k;
  for (int i = 1; i <= n; i++) {
    cin >> ss[i];
    for (int j = 0; j < m; j++) {
      if (ss[i][j] == '.') total++;
      int x = (i - 1) * m + j;
      int y = (i - 2) * m + j;
      if (ss[i][j] == '.' && ss[i - 1][j] == '.' && i > 1) {
        adj[x + 1].push_back(y + 1);
        adj[y + 1].push_back(x + 1);
      }
      if (ss[i][j] == '.' && ss[i][j - 1] == '.' && j > 0) {
        adj[x + 1].push_back(x);
        adj[x].push_back(x + 1);
      }
    }
  }
  int nodes = n * m;
  for (int i = 1; i <= nodes; i++) {
    int r, c;
    if (i % m == 0) {
      r = i / m;
      c = m - 1;
    } else {
      r = i / m + 1;
      c = i % m - 1;
    }
    if (!visited[i] && ss[r][c] != '#') {
      dfs(i);
    }
  }
  for (int i = 1; i <= nodes; i++) {
    int r, c;
    if (i % m == 0) {
      r = i / m;
      c = m - 1;
    } else {
      r = i / m + 1;
      c = i % m - 1;
    }
    if (ss[r][c] != '#' && !visited[i]) {
      ss[r][c] = 'X';
    }
  }
  for (int i = 1; i <= n; i++) cout << ss[i] << "\n";
  return 0;
}
