#include<cstdio>
#include<algorithm>
using namespace std;
int n,m,r,c,a[7005][21],st[21],rasp;
bool Ver[21];
void solve()
{
     int i,s[7005],j,aux;
     for (i=0;i<=7004;++i) s[i]=0;
    for(j=1;j<=m;++j)
        if(!Ver[j])
            for(i=1;i<=n;++i)
                s[i]+=a[i][j];
        sort(s+1,s+n+1);
        aux=0;
        for(i=r+1;i<=n;++i)
            aux+=s[i];
        rasp=max(rasp,aux);
}
void back(int k)
{
    if(k==c+1)
    {
        solve();
    }
    else
    {
        for(int o=st[k-1]+1;o<=m;++o)
        {
            Ver[o]=1;
            st[k]=o;
            back(k+1);
            Ver[o]=0;
        }
    }
}
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]);
    }
    else
    {
        for(j=1;j<=n;++j)
            for(i=1;i<=m;++i)
                scanf("%d",&a[i][j]);
        swap(n,m);swap(r,c);
    }
    back(1);
    printf("%d\n",rasp);
    return 0;
}