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 JAVA):

Solution:
import java.awt.Point;
import java.util.*;
public class ArticulationPoint {
	static boolean[][] visited;
	static Point[][] parent;
	static int[][] disc;
	static int[][] backedge;
	static char[][] mat;
	static int time;
	static int n;
	static int m;
	static int clc;
	static int k;
	public static int process(int i, int j, int previ, int prevj) {
		int res = 0;
		if (i>=0 && j>=0 && i<n && j<m) {
			if (mat[i][j]=='.') {
				if (!visited[i][j]) {
					visited[i][j]=true;
					res++;
					parent[i][j]=new Point(previ,prevj);
					DFS(mat,disc,backedge,i,j);
					// voir si c'est un point d'articulation
					backedge[previ][prevj]=Math.min(backedge[previ][prevj], backedge[i][j]);
		        }
				else {
					if (parent[i][j]!= new Point(previ,prevj)) {
						backedge[previ][prevj]=Math.min(disc[i][j], backedge[previ][prevj]);
					}
				}
				
			}
		}
		return res;
	}
	public static void DFS(char[][] mat, int[][] disc, int[][] backedge, int i, int j) {
		if(clc>=k)		return;
		visited[i][j]=true;
		int child=0;
		disc[i][j]=backedge[i][j]=++time;
		
		child += process(i-1, j , i ,j);
		
		child += process (i+1, j ,i ,j);
		
		child += process(i, j+1, i , j);
				
		child += process (i, j-1, i , j);
		
		//System.out.println("Ojh "+backedge[i][j]+" "+disc[i][j]);
		if (parent[i][j]==null && child>=2 ) {
		}
		else if (parent[i][j]!=null && backedge[i][j]>=disc[i][j]) {
			//System.out.println(i+" "+j);
		}
		else {
			if (clc<k && mat[i][j]!='X') {
				//System.out.println(disc[previ][prevj]+"  "+backedge[previ][prevj]+"  "+previ+"  "+prevj);
				mat[i][j]='X';
				//System.out.println(child);
				clc++;
			}
		}
	}
	
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		n=sc.nextInt();
		m=sc.nextInt();
		k=sc.nextInt();
		sc.nextLine();
		mat=new char[n][m];
		int ki=-1;
		int kj=-1;
		boolean trouver=false;
		for (int i=0; i<n; i++) {
			String s=sc.nextLine();
			for (int j=0; j<m; j++) {
				mat[i][j]=s.charAt(j);
				if (mat[i][j]=='.' && trouver==false) {
					ki=i;
					kj=j;
					trouver=true;
				}
			}
		}
		visited=new boolean[n][m];
		disc=new int[n][m];
		parent=new Point[n][m];
		backedge=new int[n][m];
		for (int i=0; i<n; i++) {
			Arrays.fill(backedge[i], 0, m, Integer.MAX_VALUE);
		}
		time=0;
		clc=0;
		DFS(mat,disc,backedge,ki,kj);
		for (int i=0; i<n; i++) {
			for (int j=0; j<m; j++) {
				System.out.print(mat[i][j]);
			}
			System.out.println();
		}
	
		
	}
	

}