//#include<stdafx.h>
#include<iostream>
#include<fstream>
using namespace std;
short int r[301][301],q[301][301];
//nu copia ca te sparg

int main () {
	long a,s,d,i,j,i1,i2,d1,s1,max=0,harie;
	ifstream aa("teren.in");
	aa >> a >> s1 >> d1;
	for (i=1;i<=a;++i) {
		for (j=1;j<=s1;++j) {
			aa >> r[i][j];
			q[i][j]=q[i][j-1]+r[i][j];
		}
	}
	for (i1=1;i1<=a;++i1)
		for (i2=i1;i2<=a;++i2) {
			d=0; s=0;
			for (i=1;i<=s1;++i) {
				while ((s<=d1)&&(d<=s1)) {
					++d;
					s=s+q[d][i2]-q[d][i1-1];
				}
				s-=q[i][i2]-q[i][i1-1];
				harie=(d-i)*(i2-i1+1);
				if (harie>max) max=harie;
			}
		}
	ofstream ss("teren.out");
	ss<< max;
	ss.close();
	aa.close();
	return 0;
}