#include <bits/stdc++.h>
using namespace std;

ifstream fin("teren.in");
ofstream fout("teren.out");
int n, m, a[305][305], b[305][305], t[305];

int main()
{
    int x, i, j, L1, L2, H, s, A = 0;
    fin >> n >> m >> x;
    for(i = 1; i <= n; i++)
        for(j = 1; j <= m; j++)
            {
                fin >> a[i][j];
                b[i][j] = a[i][j] + b[i-1][j];
            }
    for(L1 = 1; L1 <= n; L1++)
        for(L2 = L1; L2 <= n; L2++)
        {
            H = L2-L1+1;
            for(i = 1; i <= m; i++)
                t[i] = b[L2][i] - b[L1-1][i];
            j = 1;
            s = 0;
            for(i = 1; i <= m; i++)
            {
                s += t[i];
                while(s > x)
                {
                    s -= t[j];
                    j++;
                }
                A = max(A, (i - j + 1)* H);
            }

        }
    fout << A;
    return 0;
}