#include <bits/stdc++.h>

using namespace std;

const int maxN = 7295;

int n, m, r, c;

short a[16][maxN];

short st[20];

int s[20];

bool used[20];

int result;

void solve() {
  for (int i = 1; i <= r; i++) {
    used[i] = false;
  }
  for (int i = 1; i <= r; i++) {
    used[st[i]] = true;
  }
  priority_queue<int, vector<int>, greater<int>> pq;
  int sum = 0;
  for (int j = 1; j <= m; j++) {
    int sp = 0;
    for (int i = 1; i <= n; i++) {
      if (!used[i]) {
        sp += a[j][i];
      }
    }
    sum += sp;
    pq.push(sp);
  }
  for (int i = 1; i <= c; i++) {
    sum -= pq.top();
    pq.pop();
  }
  result = max(result, sum);
}

void bkt(int p) {
  for (int i = st[p - 1] + 1; i <= n; 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]);
      }
    }
    swap(n, m);
    swap(r, c);
  } else {
    //cerr << "!!!!\n";
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= m; j++) {
        scanf("%d", &a[i][j]);
       //cerr << a[i][j]
      }
    }
  }
//  for (int i = 1; i <= n; i++) {
//    for (int j = 1; j <= m; j++) {
//      cerr << a[i][j] << " ";
//    }
//    cerr << "\n";
//  }
  bkt(1);
  printf("%d", result);
  return 0;
}