#include <cstdio>
#include <algorithm>

#define NMAX 307

using namespace std;

int n, m, k;
int Ans;
int D[NMAX][NMAX], a[NMAX][NMAX];

int main(){
    freopen("teren.in", "r", stdin);
    freopen("teren.out", "w", stdout);
    scanf("%d %d %d", &n, &m, &k);
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= m; ++j){
            scanf("%d", &a[i][j]);
            D[i][j] = D[j - 1][i] + a[i][j];
        }
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= n; ++j){
            int Cnt = 1, Sum = 0;
            for(int l = 1; l <= m; ++l){
                Sum += D[j][l] - D[i - 1][l];
                while(Cnt <= l && Sum > k){
                    Sum -= D[j][Cnt] - D[i - 1][Cnt];
                    ++Cnt;
                }
                Ans = max(Ans, (j - i + 1) * (l - Cnt + 1));
            }
        }
    printf("%d", Ans);
}