#include <fstream>

using namespace std;

ifstream f("teren.in");
ofstream g("teren.out");

int n , m , nr , x , sol;
int sum[305][305];

int main() {
    f >> n >> m >> nr;
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            f >> x;
            sum[i][j] = sum[i][j - 1] + x;
        }
    }

    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            int pos = i , st = 0;
            for (int k = 1; k <= j; ++k) {
                while (pos > 0 && st + sum[pos][j] - sum[pos][k - 1] <= nr) {
                    st += sum[pos][j] - sum[pos][k - 1];
                    --pos;
                }

                sol = max(sol , (j - k + 1) * (i - pos));
            }
        }
    }

    g << sol;
    return 0;
}