#include<fstream>
#include<algorithm>
#include<bitset>
#define maxn 303

using namespace std;

ifstream f("teren.in");
ofstream g("teren.out");

int s[maxn][maxn],run[maxn],i,j,n,m,k,p,x,y,smax,r;
bitset<maxn> a[maxn];

int main()
{
    f>>n>>m>>k;

    for(i=1;i<=n;++i)
        for(j=1;j<=m;++j)
        {
            f>>x;
            a[i][j]=x;
            s[i][j]=s[i-1][j]+x;
        }

    for(i=1;i<=n;++i)
        for(j=i;j<=n;++j)
        {
            for(p=1;p<=m;++p)
                run[p]=s[j][p]-s[i-1][p];

            x=1;
            y=1;
            r=0;
            for(y=1;y<=m;++y)
            {
                r+=run[y];
                while(x<=y&&r>k)
                    r-=run[x++];
                if(x<=y)
                    smax=max(smax,(j-i+1)*(y-x+1));
            }

        }

    g<<smax<<"\n";

    f.close();
    g.close();

    return 0;
}