Lakes in Berland

The map of Berland is a rectangle of the size n × m, which consists of cells of size 1 × 1. Each cell is either land or water. The map is surrounded by the ocean.

Lakes are the maximal regions of water cells, connected by sides, which are not connected with the ocean. Formally, lake is a set of water cells, such that it's possible to get from any cell of the set to any other without leaving the set and moving only to cells adjacent by the side, none of them is located on the border of the rectangle, and it's impossible to add one more water cell to the set such that it will be connected with any other cell.

You task is to fill up with the earth the minimum number of water cells so that there will be exactly k lakes in Berland. Note that the initial number of lakes on the map is not less than k.

Input

The first line of the input contains three integers n, m and k (1 ≤ n, m ≤ 50, 0 ≤ k ≤ 50) — the sizes of the map and the number of lakes which should be left on the map.

The next n lines contain m characters each — the description of the map. Each of the characters is either '.' (it means that the corresponding cell is water) or '*' (it means that the corresponding cell is land).

It is guaranteed that the map contain at least k lakes.

Output

In the first line print the minimum number of cells which should be transformed from water to land.

In the next n lines print m symbols — the map after the changes. The format must strictly follow the format of the map in the input data (there is no need to print the size of the map). If there are several answers, print any of them.

It is guaranteed that the answer exists on the given data.

Examples

Input

5 4 1
****
*..*
****
**.*
..**

Output

1
****
*..*
****
****
..**

Input

3 3 0
***
*.*
***

Output

1
***
***
***

Note

In the first example there are only two lakes — the first consists of the cells (2, 2) and (2, 3), the second consists of the cell (4, 3). It is profitable to cover the second lake because it is smaller. Pay attention that the area of water in the lower left corner is not a lake because this area share a border with the ocean.

思路：
第一步：利用DFS找到湖泊的位置，这里要注意在边界上的'.'不属于湖泊，要剔除这些边界点
第二步：找到湖泊的位置之后，要标记湖泊的位置，以及湖泊的面积
第三步：用结构体保存各个湖泊的的位置和面积，并对面积从小到大排序
第四步： 计算 总的湖泊数-要保留的湖泊数 的总面积，并填补这些湖泊

#include<bits/stdc++.h>
using namespace std;
char field[60][60];
int vis[60][60];
int n,m,k,flg,ans;
int dx[4] = {1,0,-1,0};
int dy[4] = {0,1,0,-1};
//结构体用来储存湖的坐标以及湖的面积大小 
struct node
	{
		int ix,iy;
		int area;
	}cell[60*60];
bool cmp(node a,node b)//按面积排序
{
	return a.area < b.area;
}
//深度搜索湖泊 
void dfs(int x,int y)
{
	vis[x][y] = 1;
	if ((x==0 || x==n-1 || y==0 || y==m-1 )&&field[x][y]=='.')//标记边界“湖泊” 
		flg = 1;
	for (int i=0;i<4;i++)
	{
		int nx = x + dx[i];
		int ny = y + dy[i];
		if ((nx==0 || nx==n-1 || ny==0 || ny==m-1 )&&field[nx][ny]=='.')//标记边界“湖泊”
			flg = 1;
		if (0<=nx && nx<n && 0<=ny && ny<m && !vis[nx][ny] && field[nx][ny]=='.')
		{
			cell[ans].area++;
			dfs(nx,ny);
		}
	}
}
// 和上面函数结合使用标记湖泊的位置和面积大小 
void check_lake()
{
	int i,j;
	for (i=0;i<n;i++)
		for (j=0;j<m;j++)
		{
			if (field[i][j]=='.' && !vis[i][j])
			{
				ans++;
				cell[ans].area = 1;
				cell[ans].ix = i;
				cell[ans].iy = j;
				dfs(i,j);
			}
			if (flg==1)//如果是边界'.'则不算做湖泊，并剔除 
			{
				ans--;
				flg = 0;
			}
		}
}
//填补湖泊函数（DFS) 
void fill_lake(int x,int y)
{
	vis[x][y] = 1;
	field[x][y] = '*';
	for (int i=0;i<4;i++)
	{
		int nx = x + dx[i];
		int ny = y + dy[i];
		if (0<=nx && nx<n && 0<=ny && ny<m && !vis[nx][ny] && field[nx][ny]=='.')
		{
			fill_lake(nx,ny);
		}
	}
}
//需要填补的最小面积，并且和Fill_lake一起使用填补应该被填补的湖泊，并计算所需买面积 
int fill_area()
{
	int s = 0;
	for (int i=1;i<=ans-k;i++)
	{
		s += cell[i].area;
		fill_lake(cell[i].ix,cell[i].iy);
	}
	return s;
}

int main()
{
	while(scanf("%d %d %d",&n,&m,&k)!=EOF)
	{
		int i,j;
		for (i=0;i<n;i++)
			scanf("%s",field[i]);
		ans = 0;
		flg = 0;
		memset(vis,0,sizeof(vis));
		check_lake();
		sort(cell+1,cell+ans+1,cmp);
		memset(vis,0,sizeof(vis));
		int s = fill_area();
		printf("%d\n",s);
		for (i=0;i<n;i++)
			printf("%s\n",field[i]);
	}
	return 0;
}