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

using namespace std;

int N,M,R,C,P,S,sol;
int A[8000][20];
int St[20];

int solve()
{
    int i,j,k=1,S=0;
    int Sum[8000];
    memset(Sum,0,sizeof(Sum));
    for(j=1; j<=M; ++j)
    {
        if(k<=C && St[k]==j) k++;
        else for(i=1; i<=N; ++i)
                Sum[i]+=A[i][j];
    }
    sort(Sum+1,Sum+N+1);
    for(i=R+1; i<=N; ++i)
        S+=Sum[i];
    return S;
}

void back(int p)
{
    int i;
    for(i=St[p-1]+1;i<=N;i++)
    {
        St[p]=i;
        if(p==C) sol=max(sol,solve());
        else back(p+1);
    }
}

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)
                cin>>A[i][j];
    }
    else
    {
        swap(N,M);
        swap(R,C);
        for(i=1; i<=M; ++i)
            for(j=1; j<=N; ++j)
                cin>>A[N-j+1][i];
    }
    back(1);
    cout<<sol;
    return 0;
}