#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef int ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll h,w,K;
    std::cin >> h>>w>>K;
    std::vector<string> s(h);
    // ll sum[26][2001][2001];
    vector<vector<vector<ll>>> sum(26,vector<vector<ll>>(h+1,vector<ll>(w+1)));
    for (int i = 0; i < h; i++) {
        std::cin >> s[i];
        for (int j = 0; j < w; j++) {
            int alpha = s[i][j]-'a';
            for (int k = 0; k < 26; k++) {
                sum[k][i+1][j+1] = sum[k][i][j+1] + sum[k][i+1][j] - sum[k][i][j];
            }
            sum[alpha][i+1][j+1]++;
        }
    }
    ll result = 0;
    
    for (int i = 0; i < h; i++) {
        for (int j = 0; j < w; j++) {
            ll l = 1;
            ll r = min(h-i,w-j);
            // std::cout << l<<" "<<r << std::endl;
            
            // numより大きいなら小さく
            // numより小さいなら大きく
            
            // K未満の最大値
            if(K==1){
                l = 0;
            }else{
                while(r-l>1){
                    ll m = (r+l)/2;
                    ll num = 0;
                    for (int k = 0; k < 26; k++) {
                        ll cou = sum[k][i+m][j+m]-sum[k][i][j+m]-sum[k][i+m][j]+sum[k][i][j];
                        if(cou>0)num++;
                    }
                    if(num<K){
                        l = m;
                    }else{
                        r = m;
                    }
                }
            }
            
            ll maxmiman = l;
            r = min(h-i,w-j);
            
            while(r-l>1){
                ll m = (r+l)/2;
                ll num = 0;
                for (int k = 0; k < 26; k++) {
                    ll cou = sum[k][i+m][j+m]-sum[k][i][j+m]-sum[k][i+m][j]+sum[k][i][j];
                    if(cou>0)num++;
                }
                if(num <= K){
                    l = m;
                }else{
                    r = m;
                }
            }
            // rが既に満たす可能性
            ll num = 0;
            ll m = min(h-i,w-j);
            // std::cout << i+m+1<<" "<<j+m+1 << std::endl;
            for (int k = 0; k < 26; k++) {
                ll cou = sum[k][i+m][j+m]-sum[k][i][j+m]-sum[k][i+m][j]+sum[k][i][j];
                if(cou>0)num++;
            }
            
            if(num==K){
                result += r-maxmiman;
            }else{
                result += l-maxmiman;
            }
            // std::cout << i<<" i:j, "<<j << std::endl;
            // std::cout << l<<" "<<maxmiman << std::endl;
            
            // Kである最大値。
            
        }
    }
    std::cout << result << std::endl;
}