#include <fstream>
using namespace std;

ifstream fin ("teren.in");
ofstream fout("teren.out");

int n,m,a[303][303],X,x,i,j,st,dr,maxim;

int main(){
    fin>>n>>m>>X;
    for (i=1;i<=n;i++)
        for (j=1;j<=m;j++){
            fin>>x;
            a[i][j]=x+a[i-1][j]+a[i][j-1]-a[i-1][j-1];
        }
    for (i=1;i<=n;i++)
        for (j=i;j<=n;j++)
            for (st=1,dr=1;dr<=m;dr++){
                while (st<=dr && (a[j][dr]-a[i-1][dr]-a[j][st-1]+a[i-1][st-1])>X)
                    st++;
                maxim=max(maxim,(j-i+1)*(dr-st+1));
            }
    fout<<maxim;
    fin.close();
    fout.close();
    return 0;
}