#include <fstream>
#include <string>
#include <algorithm>
#include <vector>
#include <functional>

using namespace std;

ifstream cin("elimin.in");
ofstream cout("elimin.out");

const int NMAX = 7294;
int M, N, R, C;
int *a[NMAX];
bool use[NMAX];
int e[32];
int ans;

vector<int> sums;

void goLine(int k) {
	if(k == R + 1) {
		for(int j = 0;j < N;j++) {
			sums[j] = 0;
			for(int i = 0;i < M;i++) {
				if(!use[i]) {
					sums[j] += a[i][j];
				}
			}
		}
		sort(sums.begin(),sums.end(),greater<int>());
		int sum = 0;
		for(int j = 0;j < N - C;j++) {
			sum += sums[j];
		}
		ans = max(ans,sum);
	} else {
		for(int j = e[k - 1] + 1;j < M;j++) {
			e[k] = j;
			use[j] = true;
			goLine(k + 1);
			use[j] = false;
		}
	}
}

void goColumn(int k) {
	if(k == C + 1) {
		for(int i = 0;i < M;i++) {
			sums[i] = 0;
			for(int j = 0;j < N;j++) {
				if(!use[j]) {
					sums[i] += a[i][j];
				}
			}
		}
		sort(sums.begin(),sums.end(),greater<int>());
		int sum = 0;
		for(int j = 0;j < N - R;j++) {
			sum += sums[j];
		}
		ans = max(ans,sum);
	} else {
		for(int j = e[k - 1] + 1;j < N;j++) {
			e[k] = j;
			use[j] = true;
			goColumn(k + 1);
			use[j] = false;
		}
	}
}

int main()
{
	cin>>M>>N>>R>>C;
	for(int i = 0;i < M;i++) {
		a[i] = new int[N];
		for(int j = 0;j < N;j++) {
			cin>>a[i][j];
		}
	}
	e[0] = -1 ;
	if(M <= N) {
		sums.resize(N);
		goLine(1);
	} else {
		sums.resize(M);
		goColumn(1);
	}
	cout<<ans;
	return 0;
}