#include <stdio.h>
#include <algorithm>

using namespace std;

#define MAX_N 4096

int n, m, r, c, sol;
int A[16][MAX_N];
int v[MAX_N], fol[MAX_N], s[MAX_N];

void cit() {
	freopen("elimin.in", "r", stdin);
	freopen("elimin.out", "w", stdout);

	scanf("%d %d %d %d", &n, &m, &r, &c);
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) 
			scanf("%d", &v[j]);
		if (n <= m)
			for (int j = 1; j <= m; j++)
				A[i][j] = v[j];
		else 
			for (int j = 1; j <= m; j++)
				A[j][i] = v[j];
	}

	if (n > m) {
		swap(n, m);
		swap(r, c);
	}
}

void solve() {
	for (int i = 1; i <= m; i++) {
		s[i] = 0;
		for (int j = 1; j <= n; j++)
			if (!fol[j]) s[i] += A[j][i];
	}

	sort(s + 1, s + m + 1);

	int val = 0;
	for (int i = c + 1; i <= m; i++)
		val += s[i];

	sol = max(sol, val);
}

void back(int nr, int poz) {
	if (nr == r + 1) {
		solve();
		return;
	}

	if (poz > n) return;

	for (int i = poz; i <= n; i++) {
		fol[i] = 1;
		back(nr + 1	, i + 1);
		fol[i] = 0;
	}
}

int main() {

	cit();
	back(1, 1);
	printf("%d\n", sol);

	return 0;
}