#include<iostream>
#include<fstream>
int a[301][301];
using namespace std;
int main(void)
{
	int i,j,m,n,x,max=-1;
	fstream f,g;
	f.open("teren.in",ios::in);
	g.open("teren.out",ios::out);
	f>>n>>m>>x;
	for (i=1;i<=n;i++)
		for (j=1;j<=m;j++)
			f>>a[i][j];
	for (i=2;i<=m;i++)
	{
		a[1][i]=a[1][i]+a[1][i-1];
		if (a[1][i]<=x && i>max)
			max=1*i;
	}
	for (i=2;i<=n;i++)
	{
		a[i][1]=a[i][1]+a[i-1][i];
		if (a[i][1]<=x && i>max)
			max=1*i;
	}
	for (i=2;i<=n;i++)
		for (j=2;j<=m;j++)
			a[i][j]=a[i][j]+a[i-1][j]+a[i][j-1]-a[i-1][j-1];
		
	int k=0,aux,s,k1,st,dr,nr1;
	
	for(i=1;i<=n;i++)
	{
		for(j=1;j<=n;j++)
		{
			st=1;
			for(dr=st;dr<=m;dr++)
			{
				nr1=a[j][dr]-a[i-1][dr]-a[j][st-1]+a[i-1][st-1];
				if(nr1>x)
				{
					if((dr-st)*(j-i+1)>max)
						max=(dr-st)*(j-i+1);
					dr--;
					st++;
				}
			}
		if(nr1<=x && (dr-st)*(j-i+1)>max)
		{
			max=(dr-st)*(j-i+1);
		}
		}
	}
		g<<max;
}