#include <stdio.h>
#include <stdlib.h>

int compar(const void* a, const void* b) {
    return (*(int*)b - * (int*)a);
}

int main() {
    int n, m, k, x = 0;
    scanf("%d %d %d", &n, &m, &k);
    char str[n][m+1];
    int arr[n*m];
    for (int i = 0; i < n; i++) {
        scanf("%s", str[i]);
    }
    for (int i = 0; i < m; i++) {
        int count = 0;
        for (int j = 0; j < n; j++) {
            if (str[j][i] == 'o') {
                count++;
                if (j == n-1) {
                    arr[x++] = count;
                }
            }else if (str[j][i] == '*' && count != 0) {
                arr[x++] = count;
                count = 0;
            }
        }
    }
    int point = 0;
    qsort(arr, x, sizeof(int), compar);
    for (int i = 0; i < x; i++) {
        if (k < arr[i]) {
            point = point + k-1;
        }else if (k >= arr[i]) {
            point = point + arr[i] - 1;
        }
         k = k - arr[i];
         if (k <= 0) {
            break;
        }
    }
    printf("%d",point);

    return 0;
}