#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>

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

int m, n, r, c;
vector<vector<int>> arr;
vector<int> del;
vector<int> col_sum;
int ans = -2000000000;

void gen_sol(int used, int start) {
    if (used == r) {

        for (int j = 0; j < n; j++) {
            col_sum[j] = 0;
            for (int i = 0; i < m; i++)
                if (!del[i])
                    col_sum[j] += arr[i][j];
        }

        sort(col_sum.begin(), col_sum.end());
        int sum = 0;
        for (int j = c; j < n; j++)
            sum += col_sum[j];

        ans = max(ans, sum);
    }
    else {
        for (int i = start; i < m; i++) {
            del[i] = 1;
            gen_sol(used+1, start+1);
            del[i] = 0;
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    fin >> m >> n >> r >> c;
    if (m > n) {
        arr = vector<vector<int>>(n, vector<int>(m));
        del = vector<int>(n, 0);

        for (int i = 0; i < m; i++)
            for (int j = 0; j < n; j++)
                fin >> arr[j][i];
        swap(m, n);
        swap(r, c);
    }
    else {
        arr = vector<vector<int>>(m, vector<int>(n));
        del = vector<int>(m, 0);

        for (int i = 0; i < m; i++)
            for (int j = 0; j < n; j++)
                fin >> arr[i][j];
    }
    col_sum = vector<int>(n);
    gen_sol(0, 0);
    fout << ans;
}