#include <bits/stdc++.h>
using namespace std;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  char mat[n + 2][m + 2];
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < m; ++j) {
      char c;
      cin >> c;
      mat[i][j] = c;
    }
  }
  int totDot = 0;
  bool visited[n + 2][m + 2];
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < m; ++j) visited[i][j] = false;
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < m; ++j) totDot += (mat[i][j] == '.');
  queue<pair<int, int> > q;
  int totConnected = totDot - k;
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < m; ++j)
      if (mat[i][j] == '.') {
        q.push(make_pair(i, j));
        goto ed;
      }
ed:
  int i = 0;
  while (!q.empty() && i < totConnected) {
    pair<int, int> node = q.front();
    q.pop();
    int x = node.first;
    int y = node.second;
    if (visited[x][y] == true) continue;
    visited[x][y] = true;
    i++;
    for (int i = 0; i < 4; ++i) {
      int xx = x + dy[i];
      int yy = y + dx[i];
      if (xx >= 0 && yy >= 0 && xx < n && yy < m && !visited[xx][yy] &&
          mat[xx][yy] == '.') {
        q.push(make_pair(xx, yy));
      }
    }
  }
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < m; ++j) {
      if (mat[i][j] == '#')
        cout << "#";
      else if (mat[i][j] == '.' && visited[i][j])
        cout << ".";
      else
        cout << "X";
    }
    cout << endl;
  }
  return 0;
}
