#include <fstream>
using namespace std;

ifstream fin ("teren.in");
ofstream fout("teren.out");

int a[303][303], s[303][303];
int n, m, i, j, i1, j1, i2, j2, x, sum, maxim, p;
int main() {

    fin>>n>>m>>x;
    for (i=1;i<=n;i++)
        for (j=1;j<=m;j++) {
            fin>>a[i][j];
            s[i][j] = s[i-1][j] + a[i][j];
        }
    for (i1=1;i1<=n;i1++)
        for (i2=i1;i2<=n;i2++) {

            sum = 0;
            p = 1;
            for (j=1;j<=m;j++) {
                sum += (s[i2][j] - s[i1-1][j]);
                while (sum > x) {
                    sum -= (s[i2][p] - s[i1-1][p]);
                    p++;
                }
                if ((j-p+1)*(i2-i1+1) > maxim)
                    maxim = (j-p+1)*(i2-i1+1);
            }
        }


    fout<<maxim;
}