Problem: Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, or is a wall. You can go from one cell to another only if both cells are empty and have a common side.

Pavel drew a grid maze with all empty cells forming a connected area. That is, you can go from any empty cell to any other one. Pavel doesn't like it when his maze has too little walls. He wants to turn exactly k empty cells into walls so that all the remaining cells still formed a connected area. Help him.

Input

The first line contains three integers n, m, k (1 ≤ n, m ≤ 500, 0 ≤ k < s), where n and m are the maze's height and width, correspondingly, k is the number of walls Pavel wants to add and letter s represents the number of empty cells in the original maze.

Each of the next n lines contains m characters. They describe the original maze. If a character on a line equals ".", then the corresponding cell is empty and if the character equals "#", then the cell is a wall.

Output

Print n lines containing m characters each: the new maze that fits Pavel's requirements. Mark the empty cells that you transformed into walls as "X", the other cells must be left without changes (that is, "." and "#").

It is guaranteed that a solution exists. If there are multiple solutions you can output any of them.

Examples

Input

3 4 2
#..#
..#.
#...


Output

#.X#
X.#.
#...


Input

5 4 5
#...
#.#.
.#..
...#
.#.#


Output

#XXX
#X#.
X#..
...#
.#.#

Solution (in PYTHON):

Solution:
"""Template for Python Competitive Programmers prepared by Mayank Chaudhary """

# to use the print and division function of Python3
from __future__ import division, print_function

"""value of mod"""
MOD = 998244353
mod = 10**9 + 7

"""use resource"""
# import resource
# resource.setrlimit(resource.RLIMIT_STACK, [0x100000000, resource.RLIM_INFINITY])

"""for factorial"""

# def prepare_factorial():
#     fact = [1]
#     for i in range(1, 100005):
#         fact.append((fact[-1] * i) % mod)
#     ifact = [0] * 100005
#     ifact[100004] = pow(fact[100004], mod - 2, mod)
#     for i in range(100004, 0, -1):
#         ifact[i - 1] = (i * ifact[i]) % mod
#
#     return fact, ifact

"""uncomment next 4 lines while doing recursion based question"""
import threading
threading.stack_size(2**27)
import sys
sys.setrecursionlimit(10000)


"""uncomment modules according to your need"""
# from bisect import bisect_left, bisect_right, insort
# import itertools
# from math import floor, ceil, sqrt
# from heapq import heappop, heapify, heappush
# from random import randint as rn
# from Queue import Queue as Q
from collections import Counter, defaultdict, deque

'''
def modinv(n, p):
    return pow(n, p - 2, p)
'''


# def ncr(n, r,  fact, ifact):  # for using this uncomment the lines calculating fact and ifact
#     t = ((fact[n]) * (ifact[r] % mod)) % mod
#     return t



def get_ints(): return map(int, sys.stdin.readline().strip().split())
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))
def input(): return sys.stdin.readline().strip()


def GCD(x, y):
    while (y):
        x, y = y, x % y
    return x
#
# def lcm(x, y):
#     return (x*y)//(GCD(x, y))
#
# def get_xor(n):
#     return [n,1,n+1,0][n%4]


"""*******************************************************"""


def main():

    n,m,k = get_ints()
    mat = []
    for i in range(n):
        mat.append(list(input()))
    count = 0
    x,y = 0,0
    for i in range(n):
        for j in range(m):
            if mat[i][j]=='.':
                x,y = i,j
                count += 1
    remaining = count - k
    # print(remaining)

    # lets do a bfs
    Q = deque()
    Q.append((x, y))
    visited = set()
    while Q and remaining:
        x,y = Q.popleft()
        if (x, y) in visited:
            continue
        visited.add((x, y))
        mat[x][y] = 'X'
        remaining -= 1

        if 0<=(x-1)<n and 0<=y<m and mat[x-1][y]=='.' and (x-1, y) not in visited:
            Q.append((x-1, y))
        if 0<=(x+1)<n and 0<=y<m and mat[x+1][y]=='.' and (x+1, y) not in visited:
            Q.append((x+1, y))
        if 0<=x<n and 0<=(y-1)<m and mat[x][y-1]=='.' and (x, y-1) not in visited:
            Q.append((x, y-1))
        if 0<=x<n and 0<=(y+1)<m and mat[x][y+1]=='.' and (x, y+1) not in visited:
            Q.append((x, y+1))

        # print(remaining, x, y)

    # for i in mat:
    #     print(''.join(i))
    # print("---------------------------")

    for i in range(n):
        for j in range(m):
            if mat[i][j]=='X':
                mat[i][j] = '.'
            elif mat[i][j]=='.':
                mat[i][j]='X'

    for i in mat:
        print(''.join(i))




""" -------- Python 2 and 3 footer by Pajenegod and c1729 ---------"""

py2 = round(0.5)
if py2:
    from future_builtins import ascii, filter, hex, map, oct, zip

    range = xrange

import os, sys
from io import IOBase, BytesIO

BUFSIZE = 8192


class FastIO(BytesIO):
    newlines = 0

    def __init__(self, file):
        self._file = file
        self._fd = file.fileno()
        self.writable = "x" in file.mode or "w" in file.mode
        self.write = super(FastIO, self).write if self.writable else None

    def _fill(self):
        s = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
        self.seek((self.tell(), self.seek(0, 2), super(FastIO, self).write(s))[0])
        return s

    def read(self):
        while self._fill(): pass
        return super(FastIO, self).read()

    def readline(self):
        while self.newlines == 0:
            s = self._fill();
            self.newlines = s.count(b"\n") + (not s)
        self.newlines -= 1
        return super(FastIO, self).readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.getvalue())
            self.truncate(0), self.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        if py2:
            self.write = self.buffer.write
            self.read = self.buffer.read
            self.readline = self.buffer.readline
        else:
            self.write = lambda s: self.buffer.write(s.encode('ascii'))
            self.read = lambda: self.buffer.read().decode('ascii')
            self.readline = lambda: self.buffer.readline().decode('ascii')


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip('\r\n')

""" main function"""

if __name__ == '__main__':
    # main()
    threading.Thread(target=main).start()