#include<fstream>
#include<algorithm>
using namespace std;

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

int M,N,L,C,a[512][512],afis;

struct pl{int sum,idx;}sl[512],sc[512];

bool cmp(pl s1,pl s2)
{
    return s1.sum<s2.sum;
}

int main()
{
    f>>M>>N>>L>>C;

    for (int i=1;i<=M;i++)
        for (int j=1;j<=N;j++)
                {f>>a[i][j]; afis+=a[i][j];
                 sl[i].sum+=a[i][j];
                 sl[i].idx=i;

                 sc[j].sum+=a[i][j];
                 sc[j].idx=j;
                 }
    sort (sl+1,sl+M+1,cmp);

    for (int i=1;i<=L;i++)
    {afis-=sl[i].sum;
        for (int j=1;j<=N;j++)
            sc[j].sum-=a[  sl[i].idx ][j];
    }

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

    for (int i=1;i<=C;i++)
        afis-=sc[i].sum;

    g<<afis;


return 0;
}