#include<stdio.h>

int max( int a,int b)
{
    if(a>b)
    return a;
    return b;
}

int s[301][301],aux;
int a[301];

int main()
{
 freopen("teren.in","r",stdin);
 freopen("teren.out","w",stdout);
 
 int n,m,x,amax=0;
 int st,dr,suma,i,j,k;
 scanf("%d%d%d",&n,&m,&x);
 
 for(i=1; i<=n; ++i)
  for(j=1; j<=m; ++j){
  scanf("%d",&aux);
  s[i][j]=s[i-1][j]+aux;}
   
   for(j=1; j<=n; ++j)
    for(i=1; i<=j; ++i)
 {   
    for(k=1; k<=m; ++k)
    a[k]=s[j][k]-s[i-1][k];
    
    st=1;
    suma=0;
    
    for(dr=1; dr<=m; ++dr)
   { 
    suma+=a[dr];         
    while(st<=dr && suma>x)
    suma-=a[st++];
    
    if(st<=dr)
    amax= max( amax , (dr-st+1)*(j-i+1) );
   }
 }  

printf("%d\n",amax);  
    
 return 0;
}