#include <bits/stdc++.h>

using namespace std;

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

int n, m, r, c, fr[10000], fr2[10000], maxim, matrix[1000][1000];

int main()
{
    fin >> n >> m >> r >> c;
    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j < m; ++j)
        {
            if (n >= m) fin >> matrix[i][j];
            else fin >> matrix[j][i];
        }
    }
    if (n < m)
    {
        swap(n, m);
        swap(r, c);
    }
    int l = (1 << m);
    for (int stare = 0; stare < l; ++stare)
    {
        if (__builtin_popcount(stare) == c)
        {
            for (int i = 0; i < n; ++i)
            {
                fr2[i] = 0;
            }
            for (int i = 0; i < m; ++i)
            {
                int bit = (stare >> i) & 1;
                if (bit == 0)
                    for (int j = 0; j < n; ++j)
                    {
                        fr2[j] += matrix[j][i];
                    }
            }
            sort(fr2, fr2 + n);
            int sum = 0;
            for (int i = r; i < n; ++i)
            {
                sum += fr2[i];
            }
            maxim = max(maxim, sum);
        }
    }
    fout << maxim;
    fin.close();
    fout.close();
    return 0;
}