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

using namespace std;

int N,M,R,C,P,S,sol;
int A[7300][20];
int Sum[7300];

int main()
{
    int i,j,p,nr;
    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]);
    }
    else
    {
        swap(N,M);
        swap(R,C);
        for(i=1; i<=M; ++i)
            for(j=1; j<=N; ++j)
                scanf("%d",&A[N-j+1][i]);
    }
    P=(1<<M)-1;
    for(p=0; p<=P; ++p)
    {
        nr=0;
        memset(Sum,0,sizeof(Sum));
        for(j=1; j<=M; ++j)
        {
            if(p & (1<<(j-1))) ++nr;
            if(nr>C) break;
            if(!(p & (1<<(j-1))))
            {
                for(i=1; i<=N; ++i)
                    Sum[i]+=A[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;
    }
    printf("%d\n",sol);
    return 0;
}