#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void check_max(T& actual, T check) {
  if (actual < check) {
    actual = check;
  }
}
template <class T>
inline void check_min(T& actual, T check) {
  if (actual > check) {
    actual = check;
  }
}
const double EPS = 1e-9;
const int IINF = 1000000000;
const double PI = acos(-1.0);
const long long LINF = 6000000000000000000LL;
namespace Solution {
const int maxN = 555;
const int maxM = 555;
const int maxV = maxN * maxM;
set<pair<int, int> > st;
int n, m, k, rank1, RANK[maxN][maxM], TIN[maxV], FUP[maxV], CUT[maxV], timer;
pair<int, int> DATA[maxV];
vector<int> G[maxV];
char S[maxN][maxM];
void cleanup() {
  rank1 = 0;
  timer = 1;
  st.clear();
  memset(TIN, 0, sizeof(TIN));
  memset(FUP, 0, sizeof(FUP));
  memset(CUT, 0, sizeof(CUT));
  memset(RANK, -1, sizeof(RANK));
  for (int i = 0; i < maxV; ++i) {
    G[i].clear();
    DATA[i] = make_pair(0, 0);
  }
}
void dfs(int v, int parent) {
  if (timer > rank1 - k) return;
  st.insert(DATA[v]);
  int childeren = 0;
  TIN[v] = FUP[v] = timer++;
  for (int i = 0; i < ((int)G[v].size()); ++i) {
    int to = G[v][i];
    if (to == parent) continue;
    if (TIN[to] == 0) {
      dfs(to, v);
      childeren++;
      check_min(FUP[v], FUP[to]);
      if (parent != -1 && FUP[to] >= TIN[v]) {
        CUT[v] = 1;
        ;
      }
    } else {
      check_min(FUP[v], TIN[to]);
    }
  }
  if (parent == -1 && childeren > 1) {
    CUT[v] = 1;
  }
}
bool Read() {
  cleanup();
  if (scanf("%d%d%d", &n, &m, &k) == 3) {
    for (int i = 0; i < n; ++i) {
      scanf("%s", S[i]);
    }
    return true;
  }
  return false;
}
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
void Run() {
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < m; ++j) {
      if (S[i][j] != '#') {
        RANK[i][j] = rank1++;
        DATA[RANK[i][j]] = make_pair(i, j);
      }
    }
  }
  int num = -1;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < m; ++j) {
      if (S[i][j] == '#') continue;
      num = RANK[i][j];
      for (int s = 0; s < 4; ++s) {
        int n_x = i + dx[s];
        int n_y = j + dy[s];
        if (n_x >= 0 && n_x < n && n_y >= 0 && n_y < m) {
          if (S[n_x][n_y] != '#') {
            G[RANK[i][j]].push_back(RANK[n_x][n_y]);
            G[RANK[n_x][n_y]].push_back(RANK[i][j]);
          }
        }
      }
    }
  }
  if (num == -1) {
    assert(k == 0);
    for (int i = 0; i < n; ++i) {
      printf("%s\n", S[i]);
    }
  } else {
    dfs(num, -1);
    for (int i = 0; i < n; ++i) {
      for (int j = 0; j < m; ++j) {
        if (S[i][j] != '#' && st.find(make_pair(i, j)) == st.end()) {
          S[i][j] = 'X';
        }
      }
    }
    for (int i = 0; i < n; ++i) {
      printf("%s\n", S[i]);
    }
  }
}
}  // namespace Solution
namespace StressTest {
void GenerateInput() {
  FILE* output = fopen("input.txt", "w");
  fclose(output);
}
void BruteForce() {
  FILE* input = fopen("input.txt", "r");
  FILE* output = fopen("brute.out", "w");
  fclose(input);
  fclose(output);
}
}  // namespace StressTest
int main() {
  while (Solution::Read()) {
    Solution::Run();
  }
  return 0;
}
