#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<deque>
using namespace std;

int v[305][305], s[305];
int n, m, x;
deque <int> q;

int bs (int right, int val) {
    int mid, left = 0, last = right;

    while(left <= right) {
        mid = (left + right) / 2;
        if(s[mid] < val)
            left = mid + 1;
        else
            if(s[mid] >= val)
                last = mid,
                right = mid - 1;
    }
    return last;
}

int main() {
    freopen("teren.in", "r", stdin);
    freopen("teren.out", "w", stdout);
    int val, amax, pos, i, j, sus, jos;


    scanf("%d%d%d", &n, &m, &x);
    for(i = 1; i <= n; ++ i)
        for(j = 1; j <= m; ++ j) {
            scanf("%d", &val);
            v[i][j] = v[i - 1][j] + val;
        }

    amax = 0;
    for(jos = 1; jos <= n; ++ jos)
        for(sus = 1; sus <= jos; ++ sus) {
            memset(s, 0, sizeof(s));

            for(j = 1; j <= m; ++ j)
                s[j] = s[j - 1] + v[jos][j] - v[sus - 1][j];
            q.push_back(0);
            for(j = 1; j <= m; ++ j) {
                q.push_back(j);
                while(!q.empty() && s[q.front()] < s[j] - x)
                    q.pop_front();

                amax = max(amax, (jos - sus + 1) * (j - q.front()));
            }

            while(!q.empty())
                q.pop_back();
            //if(jos == 3 && sus == 1)
                //fprintf(stderr, "%d %d\n", amax, 3 - bs(3, 0));
        }

    printf("%d\n", amax);
    return 0;
}