#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <cstring>
#include <cctype>
#include <algorithm>
#include <climits>
#include <queue>
using namespace std;
typedef long long LL;

#ifdef INFOARENA
#define ProblemName "elimin"
#endif

#define MCONCAT(A, B) A B
#ifdef ProblemName
#define InFile MCONCAT(ProblemName, ".in")
#define OuFile MCONCAT(ProblemName, ".out")
#else
#define InFile "fis.in"
#define OuFile "fis.out"
#endif

int nrbits(int i) {
  i = i - ((i >> 1) & 0x55555555);
  i = (i & 0x33333333) + ((i >> 2) & 0x33333333);
  return (((i + (i >> 4)) & 0x0F0F0F0F) * 0x01010101) >> 24;
}

const int MAXNARR = 8010;
int physical[MAXNARR];

int main() {
  assert(freopen(InFile, "r", stdin));
  assert(freopen(OuFile, "w", stdout));
  int N, M, R, C;
  scanf("%d%d%d%d", &N, &M, &R, &C);
  bool inverted = (N > M);
  if (inverted) {
    swap(M, N);
    swap(R, C);
  }
  int **m = (int**)malloc(N * sizeof(int**));
  for (int i = 0; i < N; ++i)
    m[i] = physical + M * i;
  if (inverted) {
    for (int j = 0; j < M; ++j)
    for (int i = 0; i < N; ++i)
      scanf("%d", &m[i][j]);
  }
  else {
    for (int i = 0; i < N; ++i)
    for (int j = 0; j < M; ++j)
      scanf("%d", &m[i][j]);
  }
  vector<int> sums(M);
  int lim = (1 << N);
  int best = INT_MIN;
  for (int msk = 0; msk < lim; ++msk) {
    if (nrbits(msk) != N - R)
      continue;
    for (int j = 0; j < M; ++j) {
      sums[j] = 0;
      for (int i = 0; i < N; ++i)
      if (msk & (1 << i))
        sums[j] += m[i][j];
    }
    sort(sums.rbegin(), sums.rend());
    int ans = 0;
    for (int it = 0; it < M - C; ++it)
      ans += sums[it];
    if (ans > best)
      best = ans;
  }
  printf("%d\n", best);
  return 0;
}