#include <bits/stdc++.h>

#define pb push_back

using namespace std;

const int maxN = 7300;

int n, m, r, c;

int maxSum;

short a[17][maxN + 5], tmp[17][maxN + 5];

int st[maxN + 5];

int s[maxN + 5];

void solve() {
  int p = 1, sum = 0;
  for (int i = 1; i <= m; i++) {
    s[i] = 0;
  }
  for (int i = 1; i <= n; i++) {
    if (p <= r && st[p] == i) {
      p++;
      continue;
    }
    for (int j = 1; j <= m; j++) {
      s[j] += a[i][j];
      sum += a[i][j];
    }
  }
  priority_queue<int, vector<int>, greater<int>> pq;
  for (int i = 1; i <= m; i++) {
    pq.push(s[i]);
  }
  for (int i = 1; i <= c; i++) {
    sum -= pq.top();
    pq.pop();
  }
  maxSum = max(maxSum, sum);
}

void bkt(int p) {
  for (int i = st[p - 1] + 1; i <= n + p - r; i++) {
    st[p] = i;
    if (p == r) {
      solve();
    } else {
      bkt(p + 1);
    }
  }
}

int main() {
  freopen("elimin.in", "r", stdin);
  freopen("elimin.out", "w", stdout);
  scanf("%d %d %d %d", &n, &m, &r, &c);
  if (n > m) {
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= m; j++) {
        scanf("%d", &a[j][i]);
        tmp[j][i] = a[j][i];
      }
    }
    swap(n, m);
    swap(r, c);
  } else {
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= m; j++) {
        scanf("%d", &a[i][j]);
        tmp[i][j] = a[i][j];
      }
    }
  }
  bkt(1);
  printf("%d\n", maxSum);
  return 0;
}