#include <bits/stdc++.h>
using namespace std;
int vis[510][510];
char str[510][510];
int n, m, s;
vector<pair<int, int> > ord;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
void dfs(int x, int y) {
  if (vis[x][y] || str[x][y] == '#') return;
  vis[x][y] = 1;
  ord.push_back(pair<int, int>(x, y));
  for (int a = 0; a < 4; a++) {
    int nx = x + dx[a], ny = y + dy[a];
    if (nx < 0 || nx >= n || ny < 0 || ny >= m) continue;
    dfs(nx, ny);
  }
}
int main() {
  cin >> n >> m >> s;
  for (int i = 0; i < n; i++) cin >> str[i];
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (str[i][j] == '.') {
        dfs(i, j);
        reverse(ord.begin(), ord.end());
        for (int k = 0; k < s; k++) str[ord[k].first][ord[k].second] = 'X';
        for (int k = 0; k < n; k++) cout << str[k] << "\n";
        return 0;
      }
    }
  }
}
