#include <bits/stdc++.h>

using namespace std;
ifstream fin("teren.in");
ofstream fout("teren.out");
int n, m, k, a[305][305];
int main()
{	
	int i, j,st,dr,sol=0;
	fin >> n >> m >> k;
	for (i=1; i<=n; i++)
		for (j = 1; j <= m; j++)
		{
			fin >> a[i][j];
			a[i][j] += a[i - 1][j] + a[i][j - 1] - a[i - 1][j - 1];
		}
	for (i=1; i<=n; i++)
	for (j = i; j <= n; j++)
	{
		st = dr = 1;
		while (dr <= m and a[j][dr] - a[i - 1][dr] - a[j][st - 1] + a[i - 1][st - 1] <= k)
			dr++;
		dr--;
		sol = max(sol, (j - i + 1) * (dr - st + 1));
		st++;
	}
	fout << sol;

	return 0;
}