#include<fstream>
using namespace std;
ifstream f("teren.in");
ofstream g("teren.out");
short int a[301][301];
int m,n,x;
int main()
{
	f>>n>>m>>x;
	int i,j,t,max=0,j1,j2,s,jos,sus;
	for(i=1;i<=n;++i)
		for(j=1;j<=m;++j)
		{
			f>>t;
			a[i][j]=a[i][j-1]+t;
		}
	for(j1=1;j1<=m;++j1)
		for(j2=j1;j2<=m; ++j2)
		{
			s=0;jos=0;
			for(sus=1;sus<=n; ++sus)
			{
				while(jos<=n && s<=x)
				{
					++jos;
					s+=a[jos][j2]-a[jos][j1-1];
				}
				if ((j2-j1+1)*(jos-sus)>max)
					max=(j2-j1+1)*(jos-sus);
				s-=a[sus][j2]-a[sus][j1-1];
			}
		}
	g<<max;
	return 0;
}