#include <fstream>

using namespace std;

const short int N=305;

short int s[N][N];
int a,n,m,x;

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

void work()
{
	in>>n>>m>>x;
	for(short int i=1;i<=n;++i)
		for(short int j=1;j<=m;++j)
		{
			in>>a;
			s[i][j]=s[i][j-1]+a;
		}
	short int p,k,dr,rez,maxe=0;
	for(p=0;p<=m;++p)
		for(k=p+1;k<=m;++k)
		{
			rez=0,dr=0;
			for(short int st=1;st<=n;++st)
			{
				while(dr<=n && rez<=x)
				{
					++dr;
					rez+=s[dr][k]-s[dr][p];
				}
				if(maxe<(p-k)*(st-dr))
					maxe=(p-k)*(st-dr);
				rez-=s[st][k]-s[st][p];
			}
		}
	out<<maxe;
}
int main()
{
	work();
	return 0;
}