#define _CRT_SECURE_NO_DEPRECATE
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <algorithm>
#define MAXN 7300

int N, M, R, C, A[MAXN][MAXN];
int RSum[MAXN], LSum[MAXN], maxx, Tsum, minn = 0x3f3f3f3f;
int in[MAXN];

inline bool cmp(int x, int y) { return x < y; }

int main(){
	assert(freopen("elimin.in", "r", stdin));
	freopen("elimin.out", "w", stdout);

	scanf("%d %d %d %d", &M, &N, &R, &C);
	//assert((M < N ? M : N) < 32);

	if (M <= N){
		for (int i = 0; i < M; ++i)
			for (int j = 0; j < N; ++j)
				scanf("%d ", &A[i][j]),
				Tsum += A[i][j],
				LSum[i] += A[i][j],
				RSum[j] += A[i][j];
	}
	else {
		for (int i = 0; i < M; ++i)
			for (int j = 0; j < N; ++j)
				scanf("%d ", &A[j][i]),
				Tsum += A[j][i],
				LSum[j] += A[j][i],
				RSum[i] += A[j][i];
		R ^= C ^= R ^= C;
		M ^= N ^= M ^= N;
	}

	for (int i = 1; i < 1 << M; ++i){
		int x = i, j = 0, sum = 0;
		for (; x; x -= x & -x, ++j);
		if (j != R) continue;

		for (int j = 0; j < N; ++j) in[j] = RSum[j];

		for (int j = 0; j < M; ++j)
			if (i & (1 << j)){
				sum += LSum[j];
				for (int k = 0; k < N; ++k) in[k] -= A[j][k];
			}

		std::sort(in, in + N, cmp);
		for (int j = 0; j < C; ++j) sum += in[j];
		if (sum < minn) minn = sum;
	}

	printf("%d", Tsum - minn);
	return 0;
}