#include <bits/stdc++.h>

using namespace std;

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

const int NMAX = 305;
int sump[NMAX][NMAX];

int main()
{
    int n,m,x;
    fin >> n >> m >> x;
    bool nr;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            fin >> nr;
            sump[i][j]=sump[i-1][j]+nr;
        }
    }
    int unu,st,dr;
    int ariemax=0;
    for(int i=1;i<=n;i++)
    {
        for(int j=i;j<=n;j++)
        {
            unu=0;
            for(int t=1;t<=m;t++)
                unu+=(sump[j][t]-sump[i-1][t]);
            st=1;
            dr=m;
            while(unu>x and st<=dr)
            {
                if((sump[j][st]-sump[i-1][st])>(sump[j][dr]-sump[i-1][dr]))
                {
                    unu-=(sump[j][st]-sump[i-1][st]);
                    st++;
                }
                else
                {
                    unu-=(sump[j][dr]-sump[i-1][dr]);
                    dr--;
                }
            }
            if(unu<=x)
                ariemax=max(ariemax,(dr-st+1)*(j-i+1));
        }
    }
    fout << ariemax;
    return 0;
}