#include<stdio.h>
long sum[301][301],a[301][301],n,i,j1,j2,j,sc,m,amax=0,cd,x,su;
int main()
{
	freopen("teren.in","r",stdin);
	freopen("teren.out","w",stdout);
	scanf("%ld%ld%ld",&n,&m,&x);
	for(i=1;i<=n;i++)
		for(j=1;j<=m;j++)
		{
			scanf("%ld",&a[i][j]);
			sum[i][j]=a[i][j]+sum[i][j-1];
		}
	for(j1=1;j1<=m;j1++)
		for(j2=j1;j2<=m;j2++)
		{
			j=0;cd=0;
			for(i=1;i<=n;i++)
			{
				if(i!=1)
				{
					cd=cd-(sum[i-1][j2]-sum[i-1][j1-1]);
				}
				while( j<=n && cd<=x )
				{
					j++;
					cd+=sum[i][j2]-sum[i][j1-1];
				}
				if((j-i)*(j2-j1)>amax)
					amax=(j-i)*(j2-j1+1);
			}
		}
	printf("%ld",amax);
	return 0;
}