#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("teren.in");
ofstream fout("teren.out");
#define MAX 310

int sc[MAX][MAX], n, m, k, b[MAX];

int main()
{
    int i, j, l, x, s, best=-1;
    fin>>n>>m>>k;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        {
            fin>>sc[i][j];
            sc[i][j]=sc[i-1][j]+sc[i][j];

        }
    }


    for(i=1;i<=n;i++)
    {
        for(j=i;j<=n;j++)
        {
            for(l=1;l<=m;l++)
            {
                b[l]=sc[j][l]-sc[i-1][l];
            }

            x=1;
            l=1;
            s=0;
            while(l<=m)
            {

                while(s+b[l]<=k && l<=m)
                {
                    s+=b[l];
                    l++;
                }
                s-=b[x];


                best=max(best, (j-i+1)*(l-x));
                x++;
            }
        }
    }
    fout<<best;

    return 0;
}