#include <fstream>
#include <algorithm>

using namespace std;

ifstream f("elimin.in");
ofstream g("elimin.out");

int a[86][86], m, n, i, j;
int r, l;
long int S;

struct suma
{
    int s;
    short indice;
}sl[86], sc[86];


int cmp(suma a, suma b)
{
    return a.s < b.s;
}

int main()
{
    f >> n >> m >> r >> l;

    for (i = 1; i <= n; i++)
    {
        for (j = 1; j <= m; j++)
        {
            f >> a[i][j];
            sl[i].s += a[i][j];
            sc[j].s += a[i][j];
            sc[j].indice = j;
            S += a[i][j];
        }
        sl[i].indice = i;
    }

    sort(sl+1, sl+n+1, cmp);

    for (i = 1; i <= r; i++)
    {
        S -= sl[i].s;
        for (j = 1; j <= m; j++)
            sc[j].s -= a[sl[i].indice][j];
    }

    sort(sc+1, sc+m+1, cmp);

    for (i = 1; i <= l; i++)
        S -= sc[i].s;

    g << S;
    return 0;
}