land.cpp

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

// ----------- define --------------
#define int long long
#define vi vector<int>
#define ii pair<int,int>
#define fi first
#define sc second
#define mp make_pair
#define pqueue priority_queue
#define popcnt __builtin_popcount
#define getBit(x, k) ((x >> k) & 1)
#define xorBit(x, k) (x ^ (1 << k))
#define siz(x) (int)((x).size())
#define all(x) (x).begin(),(x).end()
// ---------------------------------

void Main() {
  int n, m, s;
  cin >> n >> m >> s;
  vector<vi> a(n + 1, vi(m + 1));
  for (int i = 1; i <= n; i++)
  for (int j = 1; j <= m; j++) {
    cin >> a[i][j];
    a[i][j] += a[i - 1][j];
  }
  int ans = 0;
  for (int i = 1; i <= n; i++)
  for (int j = i; j <= n; j++) {
    int sum = 0, l = 1;
    for (int k = 1; k <= m; k++) {
      sum += a[j][k] - a[i - 1][k];
      while (sum > s) {
        sum -= a[j][l] - a[i - 1][l];
        l++;
      }
      ans = max(ans, (j - i + 1) * (k - l + 1));
    }
  }
  cout << ans << '\n';
}

signed main() {
  freopen("LAND.inp", "r", stdin );
  freopen("LAND.out", "w", stdout);
  cin.tie(0)->sync_with_stdio(0);
  int T = 1;
  // cin >> T;
  while (T--) Main();
}