#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const int MOD = 1e9 + 7;
const int MX = 2e5 + 5;
const int INF = 1e9 + 5;
struct hash_pair {
  template <class T1, class T2>
  size_t operator()(const pair<T1, T2>& p) const {
    auto hash1 = hash<T1>{}(p.first);
    auto hash2 = hash<T2>{}(p.second);
    return hash1 ^ hash2;
  }
};
long long gcd(long long a, long long b) {
  while (b) {
    a %= b;
    swap(a, b);
  }
  return a;
}
long long lcm(long long a, long long b) { return (a / gcd(a, b) * b); }
long long comb(long long a, long long b) {
  long long x = max(a - b, b), ans = 1;
  for (long long K = a, L = 1; K >= x + 1; K--, L++) {
    ans *= K;
    ans /= L;
  }
  return ans;
}
void task() {
  int n, m, k, cnt = 0, ans = 0;
  cin >> n >> m >> k;
  string s[n];
  for (int K = 0; K < n; K++) cin >> s[K];
  for (int K = 0; K < n; K++) {
    for (int L = 0; L < m; L++) {
      if (s[K][L] == '.') cnt++;
    }
  }
  vector<vector<bool> > vis(n, vector<bool>(m));
  for (int K = 0; K < n; K++) {
    for (int L = 0; L < m; L++) {
      if (s[K][L] == '.') {
        queue<pair<int, int> > q;
        q.push(make_pair(K, L));
        pair<int, int> u;
        while (!q.empty()) {
          u = q.front();
          q.pop();
          if (vis[u.first][u.second]) continue;
          vis[u.first][u.second] = 1;
          ans++;
          if (ans == cnt - k) {
            for (int i = 0; i < n; i++) {
              for (int j = 0; j < m; j++) {
                if (s[i][j] == '.' && !vis[i][j]) s[i][j] = 'X';
              }
            }
            for (int i = 0; i < n; i++) cout << s[i] << "\n";
            return;
          }
          if (u.first > 0 && s[u.first - 1][u.second] == '.' &&
              !vis[u.first - 1][u.second]) {
            q.push(make_pair(u.first - 1, u.second));
          }
          if (u.second > 0 && s[u.first][u.second - 1] == '.' &&
              !vis[u.first][u.second - 1]) {
            q.push(make_pair(u.first, u.second - 1));
          }
          if (u.first < n - 1 && s[u.first + 1][u.second] == '.' &&
              !vis[u.first + 1][u.second]) {
            q.push(make_pair(u.first + 1, u.second));
          }
          if (u.second < m - 1 && s[u.first][u.second + 1] == '.' &&
              !vis[u.first][u.second + 1]) {
            q.push(make_pair(u.first, u.second + 1));
          }
        }
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  task();
  return 0;
}
