#include <fstream>

using namespace std;
int  s[301][301];
int main()
{ int n,m,i,j,x,sol=0,k,p,sum,col;
    ifstream f("teren.in");
    ofstream g("teren.out");
    f>>n>>m>>k;
    for (i=1;i<=n;++i)
    for (j=1;j<=m;++j)  {
	f>>x;
	s[i][j]=s[i-1][j]+x;
    }
    for (i=1;i<=n;++i)
    for (j=i;j<=n;++j) {
	sum=0;
	col=1;
	for (p=1;p<=m;++p) {
	    sum+=s[j][p]-s[i-1][p];
	    if (sum>k) {
		col=p;
	          sum=s[j][p]-s[i-1][p];
	    }
	    if (sum<=k) sol=max(sol,(j-i+1)*(p-col+1));
	}
    }
      g<<sol;
    return 0;
}