#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];
int Sum[7300];
bitset<20> B;

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