#include <fstream>
using namespace std;
ifstream fin("teren.in");
ofstream fout("teren.out");
int n,m,k,a[301][301],s[301][301],i,i1,dr,st,sum,maxim=-1,j;
int main (){
    fin>>n>>m>>k;
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++){
            fin>>a[i][j];
            s[i][j]=a[i][j]+s[i-1][j]+s[i][j-1]-s[i-1][j-1];
        }
    for(i=1;i<=n;i++)
        for(i1=i;i1<=n;i1++){
            st=1;
            for(dr=1;dr<=m;dr++){
                while(st<=dr&&s[i1][dr]-s[i-1][dr]-s[i1][st-1]+s[i-1][st-1]>k)
                    st++;
                if(sum<=k&&(i1-i+1)*(dr-st+1)>maxim)
                        maxim=(i1-i+1)*(dr-st+1);
            }
        }
    fout<<maxim;
    return 0;
}