#include using lint = long long; constexpr int N = 2000; int acc[26][N + 1][N + 1]; void solve() { int h, w, k; std::cin >> h >> w >> k; for (int i = 1; i <= h; ++i) { for (int j = 1; j <= w; ++j) { char c; std::cin >> c; ++acc[c - 'a'][i][j]; for (auto& vv : acc) { vv[i][j] += vv[i - 1][j] + vv[i][j - 1] - vv[i - 1][j - 1]; } } } lint ans = 0; int ok, ng, mid, dl, dr, rx, ry, cnt, c; for (int lx = 1; lx <= h; ++lx) { for (int ly = 1; ly <= w; ++ly) { ok = std::min(h - lx, w - ly) + 1, ng = -1; // [lx, lx + ok] * [ly, ly + ok] >= k while (ok - ng > 1) { mid = (ok + ng) / 2; rx = lx + mid, ry = ly + mid; cnt = 0; for (int d = 0; d < 26; ++d) { c = acc[d][rx][ry] - acc[d][rx][ly - 1] - acc[d][lx - 1][ry] + acc[d][lx - 1][ly - 1]; if (c > 0) ++cnt; if (cnt >= k) break; } if (cnt >= k) { ok = mid; } else { ng = mid; } } dl = ok; ok = std::min(h - lx, w - ly) + 1, ng = dl - 1; // [lx, lx + ok] * [ly, ly + ok] > k while (ok - ng > 1) { mid = (ok + ng) / 2; rx = lx + mid, ry = ly + mid; cnt = 0; for (int d = 0; d < 26; ++d) { c = acc[d][rx][ry] - acc[d][rx][ly - 1] - acc[d][lx - 1][ry] + acc[d][lx - 1][ly - 1]; if (c > 0) ++cnt; if (cnt > k) break; } if (cnt > k) { ok = mid; } else { ng = mid; } } dr = ok; ans += dr - dl; } } std::cout << ans << "\n"; } int main() { std::cin.tie(nullptr); std::ios::sync_with_stdio(false); solve(); return 0; }