#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvi vector<vector<int> >
#define vvl vector<vector<ll> >
#define vvv(a, b, c, d, e) vector<vector<vector<e> > >(a, vector<vector<e> >(b, vector<e> (c, d)))
#define vvvl vector<vector<vector<int> > >
#define MODs 1000000007;
typedef long long int ll;
using namespace std;

int main(int argc, char const *argv[]) {
  int H, W, K;
  std::cin >> H >> W >> K;
  std::vector<string> c(H);
  for(int i=0;i<H;i++) std::cin >> c[i];
  vvvl dp = vvv(H, W, 26, 0, int);

  for(int i=0;i<26;i++){
    dp[H-1][W-1][i] = (c[H-1][W-1]-'a'==i?1:-1);
    for(int j=0;j<H;j++){
      for(int k=0;k<W;k++){
        if(j==0&&k==0) continue;
        if(c[H-1-j][W-1-k]-'a'==i) dp[H-1-j][W-1-k][i] = 1;
        else if(j==0) dp[H-1-j][W-1-k][i] = (dp[H-1-j][W-k][i]==-1?-1:dp[H-1-j][W-k][i]+1);
        else if(k==0) dp[H-1-j][W-1-k][i] = (dp[H-j][W-1-k][i]==-1?-1:dp[H-j][W-1-k][i]+1);
        else {
          if(max({dp[H-j][W-1-k][i], dp[H-1-j][W-k][i], dp[H-j][W-k][i]})==-1) dp[H-1-j][W-1-k][i]=-1;
          else dp[H-1-j][W-1-k][i] = min({(dp[H-j][W-1-k][i]==-1?1000000007:dp[H-j][W-1-k][i]+1),
             (dp[H-1-j][W-k][i]==-1?1000000007:dp[H-1-j][W-k][i]+1), (dp[H-j][W-k][i]==-1?1000000007:dp[H-j][W-k][i]+1)});
        }
        if(dp[H-1-j][W-1-k][i]!=-1&&(j+1<dp[H-1-j][W-1-k][i]||k+1<dp[H-1-j][W-1-k][i])) dp[H-1-j][W-1-k][i]=-1;
      }
    }
  }
  int ans = 0;
  for(int i=0;i<H;i++){
    for(int j=0;j<W;j++){
      std::vector<int> las(26);
      for(int k=0;k<26;k++) las[k] = (dp[i][j][k]==-1?1000000007:dp[i][j][k]);
      sort(las.begin(), las.end());
      if(las[K-1]==1000000007) continue;
      ans += min({H-i + 1, W-j+ 1, las[K]}) - las[K-1] ;
    }
  }
  std::cout << ans << '\n';

  return 0;
}