#include<fstream>
using namespace std;
int maxim, i, j, p, u, s[301][301], sum, x, t, m, n;
int main(){
	ifstream f("teren.in");
	ofstream g("teren.out");
	f>>n>>m>>x;
	for(i=1; i<=n; i++){
		for(j=1; j<=m; j++){
			f>>s[i][j];
			s[i][j]+=s[i-1][j];
		}
	}
	for(i=1; i<=n; i++)
		for(j=i; j<=n; j++){
			p=1;u=0;
			sum = 0;
			for (t=1;t<=m;t++) {
				u++;
				sum += (s[j][u] - s[i-1][u]);
				while (sum > x) {
					sum -= s[j][p] - s[i-1][p];
					p++;
				}
				if ((j-i+1) * (u-p+1) > maxim)
					maxim = (j-i+1) * (u-p+1);
			}
		}
	g<<maxim;
	return 0;
}