#include <bits/stdc++.h>

#define pb push_back

using namespace std;

const int maxN = (int)1e4;

int n, m, r, c;

int maxSum;

vector<vector<int>> a, tmp;

int s[maxN + 5];

int st[maxN + 5];

void bkt(int p, int sumAll) {
  for (int i = st[p - 1] + 1; i <= n; i++) {
    st[p] = i;
    for (int j = 1; j <= m; j++) {
      s[j] -= a[i][j];
      sumAll -= a[i][j];
    }
    if (p == r) {
      priority_queue<int> pq;
      for (int i = 1; i <= m; i++) {

      }
      maxSum = max(maxSum, sum);
    } else {
      if (sumAll >= maxSum) {
        bkt(p + 1, sumAll);
      }
    }
    for (int j = 1; j <= m; j++) {
      s[j] += a[i][j];
      sumAll += a[i][j];
    }
  }
}

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