#include <bits/stdc++.h>
const long long INF = (long long)1e7 + 1;
const long long mod = (long long)998244353;
const long long hell = (long long)1000000007;
using namespace std;
long long int power(long long int x, long long int y, long long int md) {
  long long int res = 1;
  while (y > 0) {
    if (y % 2) res = (x % md * res % md) % md;
    x = (x % md * x % md) % md;
    y = y / 2;
  }
  return res;
}
long long int modinv(long long int x) { return power(x, hell - 2, hell); }
void solve();
void fastIO() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
int main() {
  fastIO();
  int test;
  test = 1;
  while (test--) solve();
}
long long int pw(long long int k, long long int x);
long long int gcd(long long int x, long long int y);
bool issafe(int x, int y, int n, int m) {
  return (x >= 0 and y >= 0 and x < n and y < m);
}
void solve() {
  int n, m, k;
  cin >> n >> m >> k;
  int cnt = 0;
  char a[n][m];
  int x, y;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cin >> a[i][j];
      if (a[i][j] == '.') {
        cnt++;
        x = i;
        y = j;
      }
    }
  }
  cnt = cnt - k;
  if (cnt == 0) {
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        if (a[i][j] == '.')
          cout << "X";
        else
          cout << "#";
      }
      cout << "\n";
    }
    return;
  }
  queue<pair<int, int>> q;
  q.push(make_pair(x, y));
  bool vis[n][m];
  memset(vis, false, sizeof(vis));
  vis[x][y] = true;
  int dx[] = {1, -1, 0, 0};
  int dy[] = {0, 0, 1, -1};
  cnt--;
  while (cnt > 0) {
    pair<int, int> p = q.front();
    q.pop();
    for (int i = 0; i < 4; i++) {
      x = p.first + dx[i];
      y = p.second + dy[i];
      if (cnt <= 0) break;
      if (issafe(x, y, n, m) and vis[x][y] == false and a[x][y] == '.') {
        cnt--;
        q.push(make_pair(x, y));
        vis[x][y] = true;
      }
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (a[i][j] == '#')
        cout << "#";
      else if (a[i][j] == '.' and vis[i][j]) {
        cout << ".";
      } else
        cout << "X";
    }
    cout << "\n";
  }
}
long long int gcd(long long int a, long long int b) {
  while (b != 0) {
    long long int t = b;
    b = a % t;
    a = t;
  }
  return a;
}
long long int pw(long long int k, long long int x) {
  if (x == 0) return 1;
  if (x & 1)
    return ((pw(k, x - 1)) * k);
  else
    return ((pw(k, x / 2)) * (pw(k, x / 2)));
}
