#include <bits/stdc++.h>
using namespace std;
long long cnt;
long long tot;
long long k;
long long n, m;
bool visited[501][501];
string s[501];
bool isValid(long long a, long long b) {
  if (a >= 0 && a < n && b >= 0 && b < m) return 1;
  return 0;
}
void dfs(long long x, long long y) {
  if (cnt >= tot - k) return;
  if (visited[x][y]) return;
  cnt++;
  visited[x][y] = 1;
  if (cnt == tot - k) return;
  if (isValid(x - 1, y) && !visited[x - 1][y]) {
    dfs(x - 1, y);
  }
  if (isValid(x + 1, y) && !visited[x + 1][y]) {
    dfs(x + 1, y);
  }
  if (isValid(x, y - 1) && !visited[x][y - 1]) {
    dfs(x, y - 1);
  }
  if (isValid(x, y + 1) && !visited[x][y + 1]) {
    dfs(x, y + 1);
  }
}
int main() {
  bool f = 0;
  cnt = 0;
  tot = 0;
  cin >> n >> m >> k;
  memset(visited, 0, sizeof(visited));
  for (long long i = 0; i < n; i++) {
    cin >> s[i];
  }
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < m; j++) {
      if (s[i][j] == '#')
        visited[i][j] = 1;
      else
        tot++;
    }
  }
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < m; j++) {
      if (!visited[i][j]) {
        f = 1;
        dfs(i, j);
        break;
      }
    }
    if (f) break;
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (!visited[i][j]) {
        s[i][j] = 'X';
      }
      cout << s[i][j];
    }
    cout << "\n";
  }
  return 0;
}
