#include <bits/stdc++.h>
using namespace std;
template <typename T>
void printArray(T a) {
  for (auto i : a) cout << i << " ";
  cout << "\n";
}
template <typename T>
void print2DArray(T a) {
  for (auto i : a) {
    for (auto j : i) cout << j;
    cout << "\n";
  }
  cout << "\n";
}
int main(int argc, char *argv[]) {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  int n = 1;
  int m = 1;
  int k = 1;
  cin >> n >> m >> k;
  vector<vector<char>> maze = vector<vector<char>>(n, vector<char>(m));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cin >> maze[i][j];
    }
  }
  vector<vector<bool>> visited = vector<vector<bool>>(n, vector<bool>(m));
  deque<pair<int, int>> q;
  pair<int, int> start = {-1, -1};
  int freeCells = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (maze[i][j] == '.') {
        if (start.first == -1) {
          start = {i, j};
        }
        freeCells++;
      }
    }
  }
  q.push_front(start);
  k = freeCells - k;
  while (k > 0) {
    pair<int, int> c = q.front();
    int x = c.first;
    int y = c.second;
    q.pop_front();
    if (visited[x][y] || maze[x][y] == '#') {
      continue;
    }
    if (x - 1 >= 0) {
      q.push_front({x - 1, y});
    }
    if (y - 1 >= 0) {
      q.push_front({x, y - 1});
    }
    if (x + 1 < maze.size()) {
      q.push_front({x + 1, y});
    }
    if (y + 1 < maze[0].size()) {
      q.push_front({x, y + 1});
    }
    visited[x][y] = true;
    k--;
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (maze[i][j] == '.' && !visited[i][j]) {
        maze[i][j] = 'X';
      }
    }
  }
  print2DArray(maze);
  return 0;
}
