#include <bits/stdc++.h>
using namespace std;
int count1 = 1;
int number_cells[600][600];
string s[600];
int n, m, k;
vector<pair<int, pair<int, int> > > v;
void dfs(int i, int j) {
  if (!number_cells[i][j]) number_cells[i][j] = count1;
  count1++;
  if (i == 0 || i == n + 1) return;
  if (j == 0 || j == m + 1) return;
  if (!number_cells[i + 1][j] && s[i + 1][j] == '.') dfs(i + 1, j);
  if (!number_cells[i - 1][j] && s[i - 1][j] == '.') dfs(i - 1, j);
  if (!number_cells[i][j + 1] && s[i][j + 1] == '.') dfs(i, j + 1);
  if (!number_cells[i][j - 1] && s[i][j - 1] == '.') dfs(i, j - 1);
}
int main() {
  cin >> n >> m >> k;
  for (int i = 0; i <= m + 1; i++) s[0] += "#";
  for (int i = 1; i <= n; i++) {
    cin >> s[i];
    s[i] = "#" + s[i] + "#";
  }
  for (int i = 0; i <= m + 1; i++) {
    s[n + 1] += "#";
  }
  int flag = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      if (s[i][j] == '.') {
        dfs(i, j);
        flag = 1;
        break;
      }
    }
    if (flag == 1) break;
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      if (s[i][j] == '.') {
        v.push_back(make_pair(number_cells[i][j], make_pair(i, j)));
      }
    }
  }
  std::sort(v.begin(), v.end());
  int sz = v.size();
  for (int i = sz - 1; i >= 0; i--) {
    if (k == 0) break;
    int a = v[i].second.first;
    int b = v[i].second.second;
    s[a][b] = 'X';
    k--;
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      cout << s[i][j];
    }
    cout << endl;
  }
}
