//horatiu11
# include <cstdio>
# include <cstring>
# include <algorithm>
# define nmax 7301
# define mmax 21
using namespace std;
int n,m,r,c,a[nmax][mmax],st[mmax],ap[mmax],sol;
inline void back(int k)
{
    int i,s[nmax],j,aux;
    if(k==c+1)
    {
        memset(s,0,sizeof(s));
        for(j=1;j<=m;++j)
            if(!ap[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];
        sol=max(sol,aux);
    }
    else
    {
        for(i=st[k-1]+1;i<=m;++i)
        {
            ap[i]=1;
            st[k]=i;
            back(k+1);
            ap[i]=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",sol);
    return 0;
}