#include <cstdio>
int H, W, c[29], sum[29][2009][2009]; char S[2009][2009];
long long solve(int K) {
	long long ans = 0;
	for (int i = 0; i < H; ++i) {
		int sz = 0, cnt = 0;
		for (int j = 0; j < W; ++j) {
			while (cnt < K && i + sz < H && j + sz < W) {
				cnt = 0;
				++sz;
				for (int k = 0; k < 26; ++k) {
					if (sum[k][i][j] + sum[k][i + sz][j + sz] - sum[k][i][j + sz] - sum[k][i + sz][j] > 0) {
						++cnt;
					}
				}
			}
			if (sz != 0) {
				ans += sz - 1;
				if (cnt < K) ++ans;
			}
			if (sz > 0) {
				cnt = 0;
				--sz;
				for (int k = 0; k < 26; ++k) {
					if (sum[k][i][j + 1] + sum[k][i + sz][j + sz + 1] - sum[k][i][j + sz + 1] - sum[k][i + sz][j + 1] > 0) {
						++cnt;
					}
				}
			}
		}
	}
	return ans;
}
int main() {
	int K;
	scanf("%d %d %d", &H, &W, &K);
	for (int i = 0; i < H; ++i) scanf("%s", S[i]);
	for (int i = 0; i < H; ++i) {
		for (int j = 0; j < W; ++j) {
			++sum[S[i][j] - 'a'][i + 1][j + 1];
		}
	}
	for (int i = 0; i < 26; ++i) {
		for (int j = 0; j <= H; ++j) {
			for (int k = 0; k < W; ++k) {
				sum[i][j][k + 1] += sum[i][j][k];
			}
		}
		for (int j = 0; j < H; ++j) {
			for (int k = 0; k <= W; ++k) {
				sum[i][j + 1][k] += sum[i][j][k];
			}
		}
	}
	long long res1 = solve(K);
	long long res2 = solve(K + 1);
	printf("%lld\n", res2 - res1);
	return 0;
}