#include <fstream>
using namespace std;
int a[305][305], sp[305][305];
ifstream cin("teren.in");
ofstream cout("teren.out");
int main(){
    int n, m, x;
    cin >> n >> m >> x;
    for(int i = 1; i <= n; i ++){
        for(int j = 1; j <= m; j ++){
            cin >> a[i][j];
        }
    }
    for(int i = 1; i <= n; i ++){
        for(int j = 1; j <= m; j ++){
            sp[i][j] = sp[i - 1][j] + a[i][j];
        }
    }
    int maxx = -1;
    for(int l1 = 1; l1 <= n; l1 ++){
        for(int l2 = l1; l2 <= n; l2 ++){
            int st = 1, sum = 0;
            for(int k = 1; k <= m; k ++){
                sum = sum + sp[l2][k] - sp[l1 - 1][k];
                while(st <= k && sum > x){
                    sum = sum - (sp[l2][st] - sp[l1 - 1][st]);
                    st ++;
                }
                if(maxx < (l2 - l1 + 1) * (k - st + 1)){
                    maxx = (l2 - l1 + 1) * (k - st + 1);
                }
            }
        }
    }
    cout << maxx;
    return 0;
}