#include<iostream>
#include<fstream>
#include<math.h>
#include<algorithm>
#define DIM 10010
using namespace std;
ifstream fin("teren.in");
ofstream fout("teren.out");
int s[303][303],i,j,n,p,k,nr,maxim,x,ii,jj,a,m,numar;

int main(){
    fin>>n>>m>>k;
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
        {
            fin>>numar;
            s[i][j]=s[i-1][j]+s[i][j-1]-s[i-1][j-1]+numar;
        }
    for(i=1;i<=n;i++)
        for(j=i;j<=n;j++)
        {
            ii=1;
            for(jj=1;jj<=m;jj++)
            {
                while(s[j][jj]-s[j][ii-1]-s[i-1][jj]+s[i-1][ii-1]>k&&ii<=jj)
                    ii++;
                a=(jj-ii+1)*(j-i+1);
                if(a>maxim)
                    maxim=a;
            }
        }
    fout<<maxim;
    fin.close();
    fout.close();
    return 0;
}