#include <fstream>
#include <algorithm>
using namespace std;
int i, j,M,N, R, C;
int sol;
int Sum[700],st[700];
int a[700][700];
bool s[700];
void solve()
{
    int i,j,aux;
    for (i=0;i<=N;++i) Sum[i]=0;
        for(j=1;j<=M;++j)
            if(!s[j])
                for(i=1;i<=N;++i)
                    Sum[i]+=a[i][j];
        sort(Sum+1,Sum+N+1);
        aux=0;
        for(i=R+1;i<=N;++i)aux+=Sum[i];
        sol=max(sol,aux);
}
void back(int k)
{
    if (k==C+1) solve();
    else
    {
      for(i=st[k-1]+1;i<=M;++i)
        {
            s[i]=1;
            st[k]=i;
            back(k+1);
            s[i]=0;
        }
    }
}
int main()
{
   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;
}