#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++) {
        ll csize = 1;
        for (int j = 0; j < w; j++) {
            for (int size = csize; i+size<h && j+size<w; size++) {
                ll num = 0;
                bool first = true;
                for (int k = 0; k < 26; k++) {
                    ll cou;
                    cou = sum[k][i+size+1][j+size+1]-sum[k][i][j+size+1]-sum[k][i+size+1][j]+sum[k][i][j];
                    if(cou>0){
                        num++;
                    }
                }
                if(num==K){
                    result++;
                    if(first){
                        csize = size-1;
                        // std::cout << i<<" "<<j<<" "<<csize << std::endl;
                        first = false;
                    }
                }
                if(num>K){
                    if(first){
                        csize = min(1,size-1);
                    }
                    break;
                }
            }
            
        }
    }
    std::cout << result << std::endl;
}