#include<cstring>
#include<fstream>
#include<algorithm>
#define ma 22
#define na 7300

using namespace std;


ifstream f("elimin.in");
ofstream g("elimin.out");
int st[21], a[na][ma], n, m, r, c;
int viz[na], sum[ma],solutie;
void back(int k){

	if (k == c + 1){

		int sum[na];

		memset(sum, 0, sizeof(sum));

		for (int i = 1; i <= m; ++i){

			if (viz[i] ==0)
				for (int j = 1; j <= n; ++j)
					sum[j] += a[j][i];

		}

		nth_element(sum + 1, sum + 1 + r, sum + 1 + n);
		int trysol = 0;
		for (int i = r + 1; i <= n; ++i){

			trysol += sum[i];
		}
		if (trysol > solutie){
			solutie = trysol;

		}
		return;
	}
	for (int i = st[k-1]+1; i <= m; ++i){

		viz[i] = 1;
		st[k] = i;
		back(k + 1);
		viz[i] = 0;

	}
}
int main() {

	f >> n >> m >> r >> c;


	if(n>=m){
		
		for (int i = 1; i <= n; ++i){


			for (int j = 1; j <= m; ++j){
			
					
				f >> a[i][j];
			}
		}

	}
	else {

		for (int j = 1; j<= n; ++j){


			for (int i = 1; i <= m; ++i){


				f >> a[i][j];
			}
		}
		swap(n, m);
		swap(r,c);
	}

	back(1);

	g << solutie<<"\n";

	return 0;
}