#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
//author:zeze 2016-12-11 13:24:39
//DFS+Greedy
struct lakes{int x,y;//lake siteint num;//lake size
}lake[2500];
bool cmp(lakes a,lakes b){return a.num<b.num;
}
int sx[4]={0,0,-1,1};
int sy[4]={-1,1,0,0};
char map[51][51];
bool vis[51][51];
int num,cnt,ans,isLake;
int n,m,k;
void dfs(int x,int y){int xx,yy;vis[x][y]=1;num++;if(x==0||x==n-1||y==0||y==m-1)//link to oceanisLake=0;for(int i=0;i<4;i++){xx=x+sx[i];yy=y+sy[i];if(xx>=0&&xx<n&&yy>=0&&yy<m&&map[xx][yy]=='.'&&!vis[xx][yy])dfs(xx,yy);}
}
void fillLake(int x,int y){int xx,yy;vis[x][y]=1;ans++;map[x][y]='*';//fill this lakefor(int i=0;i<4;i++){xx=x+sx[i];yy=y+sy[i];if(xx>=0&&xx<n&&yy>=0&&yy<m&&map[xx][yy]=='.'&&!vis[xx][yy])fillLake(xx,yy);}
}
int main(){int i,j,t;cnt=ans=0;scanf("%d %d %d",&n,&m,&k);for(i=0;i<n;i++)scanf("%s",map[i]);memset(vis,0,sizeof(vis));for(i=0;i<n;i++){for(j=0;j<m;j++){if(!vis[i][j]&&map[i][j]=='.'){//unVisit and isWaterisLake=1;num=0;dfs(i,j);if(isLake){// Is Lake? Yes!lake[cnt].x=i;lake[cnt].y=j;lake[cnt++].num=num;}}}}sort(lake,lake+cnt,cmp);//sort lakes by nummemset(vis,0,sizeof(vis));for(t=0;t<cnt-k;t++){//fill mini lakefor(i=0;i<n;i++){for(j=0;j<m;j++){if(i==lake[t].x&&j==lake[t].y){//unVisit and isWater
                    fillLake(i,j);}}}}printf("%d\n",ans);for(i=0;i<n;i++){printf("%s\n",map[i]);}return 0;
}

#include<bits/stdc++.h>
using namespace std;
int n,m,k;
char a[55][55];
bool vis[55][55];
int dx[6]={0,0,1,-1};
int dy[6]={1,-1,0,0};int num,cnt,islake;
int ans;struct lake{int x,y;int num;int id;
}lk[2600];bool cmp(lake a,lake b){return a.num<b.num;
}void dfs(int x,int y){vis[x][y]=1;num++;if(x==0||x==n-1||y==0||y==m-1)//形成海洋不是湖islake=0;for(int i=0;i<4;i++){int nx=x+dx[i],ny=y+dy[i];if(nx>=0&&nx<n&&ny<m&&ny>=0&&a[nx][ny]=='.'&&!vis[nx][ny])dfs(nx,ny);}
}
void fil(int x,int y,int id){vis[x][y]=1;ans++;a[x][y]='*';//填充这个湖for(int i=0;i<4;i++){int nx=x+dx[i],ny=y+dy[i];if(nx>=0&&nx<n&&ny<m&&ny>=0&&a[nx][ny]=='.'&&!vis[nx][ny])fil(nx,ny,id);}
}
int main(){cnt=0;scanf("%d%d%d",&n,&m,&k);for(int i=0;i<n;i++){scanf("%s",a[i]);}memset(vis,0,sizeof(vis));for(int i=0;i<n;i++){for(int j=0;j<m;j++){if(!vis[i][j]&&a[i][j]=='.'){num=0;islake=1;dfs(i,j);if(islake)lk[cnt++]=(lake){i,j,num,cnt};}}}memset(vis,0,sizeof(vis));sort(lk,lk+cnt,cmp);for(int l=0;l<cnt-k;l++){for(int i=0;i<n;i++){for(int j=0;j<m;j++){if(i==lk[l].x&&j==lk[l].y)fil(i,j,lk[l].id);//填充这个湖
            }}}printf("%d\n",ans);for(int i=0;i<n;i++){printf("%s\n",a[i]);}
}