#include //ios::sync_with_stdio(false); //cin.tie(0); using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair pii; typedef pair ppii; typedef pair pipi; typedef pair pll; typedef pair ppll; typedef pair plpl; typedef tuple tl; ll mod=1000000007; ll mod2=998244353; ll mod3=1000003; ll inf=1000000000000000000; double pi=2*acos(0); #define rep(i,m,n) for(int i=m;i=m;i--) int dh[4]={1,-1,0,0}; int dw[4]={0,0,1,-1}; int ddh[8]={-1,-1,-1,0,0,1,1,1}; int ddw[8]={-1,0,1,-1,1,-1,0,1}; ll lmax(ll a,ll b){ if(a0){ if(k&1)ret*=now; now*=now; k/=2; } return ret; } ll dat[200010]; ll u; void seginit(ll n){ ll y=1; for(int i=0;;i++){ if(y>=n){ u=y; break; } y*=2; } fill(dat,dat+2*u,0); } void add(ll n,ll x){ ll i=n+u-1; dat[i]=x; while(i>0){ i=(i-1)/2; dat[i]=max(dat[2*i+1],dat[i*2+2]); } } ll que(ll a,ll b,ll k,ll l,ll r){ if(a>=r||b<=l)return 0; if(a<=l&&b>=r)return dat[k]; ll m1=que(a,b,2*k+1,l,(l+r)/2); ll m2=que(a,b,2*k+2,(l+r)/2,r); return max(m1,m2); } int main(){ ios::sync_with_stdio(false); cin.tie(0); ll h,w,k;cin>>h>>w>>k; string s[h];rep(i,0,h)cin>>s[i]; int d[h+1][w+1][26]; rep(i,0,h+1){ rep(j,0,w+1)rep(l,0,26)d[i][j][l]=0; } rep(i,1,h+1){ rep(j,1,w+1){ rep(l,0,26){ d[i][j][l]=d[i-1][j][l]+d[i][j-1][l]-d[i-1][j-1][l]; } d[i][j][s[i-1][j-1]-'a']++; } } ll ans=0; if(k==1)ans=h+w-1; rep(i,0,h-1){ rep(j,0,w-1){ ll u=min(h-i,w-j)+1; ll dd=0; while(u-dd>1){ ll mid=(u+dd)/2; //if(i==0&&j==0)cout<0)cnt++; } if(cnt<=k)dd=mid; else u=mid; } ll cc=dd; u=min(h-i,w-j)+1; dd=0; while(u-dd>1){ ll mid=(u+dd)/2; int cnt=0; rep(l,0,26){ int b=d[i+mid][j+mid][l]-d[i+mid][j][l]-d[i][j+mid][l]+d[i][j][l]; if(b>0)cnt++; } if(cnt