#include <cstdio>
#include <algorithm>
using namespace std;

#define NMAX 301

int i, N, M, X;
int j, k, x, p;
int S, ANS;

int Nr1[NMAX][NMAX];

int main() {
	freopen("teren.in","r",stdin);
	freopen("teren.out","w",stdout);
	scanf("%i%i%i", &N, &M, &X);
	for (i = 1; i <= N; ++i) {
		for (j = 1; j <= M; ++j) {
			scanf("%i", &x);
			Nr1[i][j] = Nr1[i - 1][j] + x;
		}
	}
	for (i = 1; i <= N; ++i) {
		for (k = i; k <= N; ++k) {
			p = 1; S = 0;
			for (j = 1; j <= M; ++j) {
				while (p <= M && S + Nr1[k][p] - Nr1[i - 1][p] <= X) {
					S += Nr1[k][p] - Nr1[i - 1][p];
					++p;
				}
				ANS = max(ANS, (k - i + 1) * (p - j));
				S -= Nr1[k][j] - Nr1[i - 1][j];
			}
		}
	}
	printf("%i\n", ANS);
	return 0;
}