#include <bits/stdc++.h>
using namespace std;

ifstream fin("elimin.in");
ofstream fout("elimin.out");

int a[105][105];
int rowSum[105];
int colSum[105];

int main() {
    int M, N, R, C;
    fin >> M >> N >> R >> C;

    for(int i = 0; i < M; i++)
        for(int j = 0; j < N; j++)
            fin >> a[i][j];

    int ans = 0;

    if(C <= N - C) {

        for(int mask = 0; mask < (1 << N); mask++) {
            if(__builtin_popcount(mask) != C) continue;

            for(int i = 0; i < M; i++) {
                rowSum[i] = 0;
                for(int j = 0; j < N; j++) {
                    if(!(mask & (1 << j))) { // pastram
                        rowSum[i] += a[i][j];
                    }
                }
            }

            nth_element(rowSum, rowSum + (M - R), rowSum + M, greater<int>());

            int sum = 0;
            for(int i = 0; i < M - R; i++)
                sum += rowSum[i];

            ans = max(ans, sum);
        }
    } else {

        int keep = N - C;

        for(int mask = 0; mask < (1 << N); mask++) {
            if(__builtin_popcount(mask) != keep) continue;

            for(int i = 0; i < M; i++) {
                rowSum[i] = 0;
                for(int j = 0; j < N; j++) {
                    if(mask & (1 << j)) {
                        rowSum[i] += a[i][j];
                    }
                }
            }

            nth_element(rowSum, rowSum + (M - R), rowSum + M, greater<int>());

            int sum = 0;
            for(int i = 0; i < M - R; i++)
                sum += rowSum[i];

            ans = max(ans, sum);
        }
    }

    fout << ans;
}