#include <iostream>
#include <algorithm>

using namespace std;
int k,a[304][305],st,dr,suma,maxi,m,x,i,j,n;

void read()
{
    cin >> n >> m >> k ;
    for ( int i=1; i<=m; i++)
        a[0][i]=0;
    for ( int i=1; i<=n; i++)
    {
        for (j=1; j<=m; j++)
        {
            cin >> x ;
            a[i][j]=a[i-1][j]+x;
        }
    }
}

void solve()
{
    for (int i=1; i<=n; i++)
    {
        for (int j=i; j<=n; j++)
        {
            for (st=1,suma=0,dr=1; dr<=m; dr++)
            {
                suma += a[j][dr]-a[i-1][dr];
                for (; ((st <= dr)&&(suma > k));)
                {
                    suma -= a[j][st]-a[i-1][st];
                    st = st+1;
                }
                if ((st<=dr)&& ((j-i+1)*(dr-st+1)>maxi))
                    maxi = (j-i+1)*(dr-st+1);
            }
        }
    }
    cout << maxi;
}

int main()
{
    read() ;
    solve();
    return 0;
}