#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
#define inf (0x3f3f3f3f)
typedef long long int LL;#include <iostream>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <string>
const int maxn = 70 * 70;
char str[50 + 20][50 + 20];
int fa[maxn];
LL size[maxn];
int calc(int x, int y) {return 50 * x + y;
}
int find(int x) {if (fa[x] == x) return x;else return fa[x] = find(fa[x]);
}
void merge(int x, int y) {x = find(x);y = find(y);if (x != y) {fa[y] = x;size[x] += size[y];}
}
int del[maxn];
struct node {LL size;int FA;bool operator < (const struct node &rhs) const {return size < rhs.size;}node(LL aa, int bb) : size(aa), FA(bb) {}
};
multiset<struct node>ss;
bool used[maxn];
void work() {int n, m, k;scanf("%d%d%d", &n, &m, &k);for (int i = 1; i <= n; ++i) {scanf("%s", str[i] + 1);}for (int i = 0; i <= maxn - 1; ++i) {size[i] = 1;fa[i] = i;}for (int i = 1; i <= n; ++i) {size[calc(i, 1)] = inf;size[calc(i, m)] = inf;}for (int i = 1; i <= m; ++i) {size[calc(1, i)] = inf;size[calc(n, i)] = inf;}for (int i = 1; i <= n; ++i) {for (int j = 1; j <= m; ++j) {if (str[i][j] == '.') {if (str[i - 1][j] == '.' && i - 1 >= 1) {merge(calc(i - 1, j), calc(i, j));}if (str[i][j - 1] == '.' && j - 1 >= 1) merge(calc(i, j), calc(i, j - 1));}}}for (int i = 1; i <= n; ++i) {for (int j = 1; j <= m; ++j) {if (str[i][j] == '*') continue;int FA = find(calc(i, j));if (used[FA]) continue;if (size[FA] >= inf) continue;ss.insert(node(size[FA], FA));used[FA] = 1;}}multiset<struct node> :: iterator it = ss.begin();int cut = ss.size() - k;int ans = 0;while (cut--) {del[it->FA] = 1;ans += size[it->FA];it++;}printf("%d\n", ans);for (int i = 1; i <= n; ++i) {for (int j = 1; j <= m; ++j) {int FA = find(calc(i, j));if (del[FA]) {printf("*");} else printf("%c", str[i][j]);}printf("\n");}
}int main() {
#ifdef localfreopen("data.txt","r",stdin);
#endifwork();return 0;
}