#include <fstream>

using namespace std;

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

int n, m, x, a, v[310][310], sp[310], ans = -1;

int main() {
    fin >> n >> m >> x;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) {
            fin >> a;
            v[i][j] = v[i - 1][j] + a;
        }
    }
    for(int i = 1; i <= n; i++) {
        for(int j = i; j <= n; j++) {
            for(int k = 1; k <= m; k++) {
                sp[k] = v[j][k] - v[i - 1][j];
            }
            int p = 1, u = 1, sc = 0;
            while(u <= m) {
                while(sp[u] + sc <= x && u <= m) {
                    sc += sp[u];
                    u++;
                }
                sc -= sp[p];
                ans = max(ans, (j - i + 1) * (u - p));
                p++;
            }
        }
    }
    fout << ans;
    return 0;
}