#include <bits/stdc++.h>
using namespace std;
ifstream fin("teren.in");
ofstream fout("teren.out");
int n, m, rez, x, mt[305][305];

void readInput() {
    fin >> n >> m >> x;
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            fin >> mt[i][j];
            mt[i][j] += mt[i - 1][j] + mt[i][j - 1] - mt[i - 1][j - 1];
        }
    }
    return;
}

void solve() {
    for (int i1 = 1; i1 <= n; ++i1) {
        for (int i2 = i1; i2 <= n; ++i2) {
            int maxim = 0;
            if (mt[i2][1] - mt[i1 - 1][1] <= x)
                maxim = 1;
            for (int st = 1, dr = 1, sum = mt[i2][1] - mt[i1 - 1][1]; st <= m && dr <= m;) {
                if (sum <= x || st >= dr) {
                    ++dr;
                    if (dr <= m)
                        sum += mt[i2][dr] - mt[i2][dr - 1] - mt[i1 - 1][dr] + mt[i1 - 1][dr - 1];
                }
                else {
                    sum -= mt[i2][st] - mt[i2][st - 1] - mt[i1 - 1][st] + mt[i1 - 1][st - 1];
                    ++st;
                }
                if (sum <= x && dr <= m)
                    maxim = max(maxim, dr - st + 1);
            }
            rez = max(rez, maxim * (i2 - i1 + 1));
        }
    }
    return;
}

int main() {
    readInput();
    solve();
    fout << rez;
    return 0;
}