#include<cstdio>
#include<cstring>
#include<bitset>
#include<algorithm>
#include<cassert>

using namespace std;

int N,M,R,C,P,S,sol;
int A[20][7300],B[7300][20];
int Sum[7300];
bitset<20> BS;

void solveA()
{
    int i,j,nr,p;
    P=(1<<N)-1;
    for(p=0;p<=P;p++)
    {
        BS=p;
        nr=0;
        memset(Sum,0,sizeof(Sum));
        for(i=1;i<=N;i++)
        {
            if(BS[i-1]) nr++;
            else for(j=1;j<=M;j++)
                    Sum[j]+=A[i][j];
        }
        if(nr!=R) continue;
        sort(Sum+1,Sum+M+1);
        S=0;
        for(j=C+1;j<=M;j++)
            S+=Sum[j];
        if(S>sol) sol=S;
    }
}

void solveB()
{
    int i,j,nr,p;
    P=(1<<M)-1;
    for(p=0;p<=P;p++)
    {
        BS=p;
        nr=0;
        memset(Sum,0,sizeof(Sum));
        for(j=1;j<=M;j++)
        {
            if(BS[j-1]) nr++;
            else for(i=1;i<=N;i++)
                    Sum[i]+=B[i][j];
        }
        if(nr!=C) continue;
        sort(Sum+1,Sum+N+1);
        S=0;
        for(i=R+1;i<=N;i++)
            S+=Sum[i];
        if(S>sol) sol=S;
    }
}

int main()
{
    int i,j;
    freopen("elimin.in","r",stdin);
    freopen("elimin.out","w",stdout);
    scanf("%d%d%d%d",&N,&M,&R,&C);
    if(N<=M)
    {
        for(i=1;i<=N;i++)
            for(j=1;j<=M;j++)
                scanf("%d",&A[i][j]);
        solveA();
    }
    else
    {
        for(i=1;i<=N;i++)
            for(j=1;j<=M;j++)
                scanf("%d",&B[i][j]);
        solveB();
    }
    printf("%d\n",sol);
    return 0;
}