#include <bits/stdc++.h>

using namespace std;

int dp[2001][2001][26];

int calc(int y1, int x1, int n) {
  int y2 = y1 + n - 1;
  int x2 = x1 + n - 1;
  int ret = 0;
  for (int k = 0; k < 26; k++)
    if (dp[y2][x2][k] - dp[y2][x1-1][k] - dp[y1-1][x2][k] + dp[y1-1][x1-1][k] > 0)
      ++ret;
  return ret;
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int h, w, p;
  cin >> h >> w >> p;

  vector<string> bd(h);
  for (int i = 0; i < h; i++)
    cin >> bd[i];

  for (int i = 0; i < h; i++) {
    for (int j = 0; j < w; j++) {
      int c = bd[i][j] - 'a';
      for (int k = 0; k < 26; k++)
        dp[i+1][j+1][k] = dp[i+1][j][k] + dp[i][j+1][k] - dp[i][j][k];
      dp[i+1][j+1][c]++;
    }
  }

  long long ret = 0;
  for (int y1 = 1; y1 <= h; y1++) {
    for (int x1 = 1; x1 <= w; x1++) {
      int max_n = min(h - y1 + 1, w - x1 + 1);

      int hi = max_n + 1;
      int lo = 0;
      while (hi - lo > 1) {
        int mi = (lo + hi) / 2;
        if (calc(y1, x1, mi) >= p)
          hi = mi;
        else
          lo = mi;
      }
      int l = hi;
      
      hi = max_n + 1;
      lo = 0;
      while (hi - lo > 1) {
        int mi = (lo + hi) / 2;
        if (calc(y1, x1, mi) > p)
          hi = mi;
        else
          lo = mi;
      }
      int r = hi;
      
      ret += r - l;
    }
  }
  cout << ret << endl;
  
  return 0;
}