#include <iostream>
#include <algorithm>
using namespace std;
#pragma warning (disable: 4996)

long long H, W, K, ans; char c[2009][2009];
int p[2009][2009][27];

int main() {
	FILE *in = freopen("in09.txt", "r", stdin);
	cin >> H >> W >> K;
	for (int i = 0; i < H; i++) scanf("%s", &c[i]);
	for (int t = 0; t < 27; t++) {
		for (int i = H; i >= 0; i--) {
			for (int j = W; j >= 0; j--) {
				if (c[i][j] == ('a' + t)) p[i][j][t] = 1;
				else {
					int z = min(H - i, W - j);
					if (z > p[i][j + 1][t]) z = p[i][j + 1][t];
					if (z > p[i + 1][j][t]) z = p[i + 1][j][t];
					if (z > p[i + 1][j + 1][t]) z = p[i + 1][j + 1][t];
					p[i][j][t] = z + 1;
				}
			}
		}
	}
	for (int i = 0; i < H; i++) {
		for (int j = 0; j < W; j++) {
			sort(p[i][j], p[i][j] + 26);
			ans += 1LL * (p[i][j][K] - p[i][j][K - 1]);
		}
	}
	cout << ans << endl;
	return 0;
}