#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
FILE*f=fopen("elimin.in","r");
FILE*g=fopen("elimin.out","w");
int st[800],n,m,R,C,a[700][700];
long Max=0,s[1000],sum;
void bug()
        {
        for(int i=1;i<=n;++i)
                {for(int j=1;j<=m;++j)
                fprintf(g,"%d ",a[i][j]);
                fprintf(g,"\n");}}
void read()
        {
        int aux,i,j;
        fscanf(f,"%d %d %d %d",&n,&m,&R,&C);
        if(n<=m) for(i=1;i<=n;++i) for(j=1;j<=m;++j) fscanf(f,"%d",&a[i][j]),sum+=a[i][j];
        if(n>m)
                {
                for(i=n;i>=1;--i)
                        for(j=1;j<=m;++j)
                        fscanf(f,"%d",&a[j][i]),sum+=a[j][i];
                aux=n; n=m; m=aux;
                aux=R; R=C; C=aux;
                }
        }
long stiva(long n)
        {
        int p=0,nr=0;
        memset(st,0,sizeof(st));
        while(n)
                {
                st[++p]=n%2;
                if(n%2==1) nr++;
                n/=2;
                }
        return nr;
         }
int cmp(const void*a, const void*b)
        {
        return *(int*)a-*(int*)b;
        }
void calcul()
        {
        int i,j,S=0,p=0;
        memset(s,0,sizeof(s));
        for(i=1;i<=m;++i)
               for(j=1;j<=n;++j)
                        if(st[j]==0) s[i-1]+=a[j][i];
                        else S+=a[j][i];
        qsort(s,m,sizeof(s[0]),cmp);
        for(i=0;i<C;++i) S+=s[i];
        Max=sum-S>Max?sum-S:Max;
        }



void solve()
        {
        long i;
        for(i=1;i<=pow(2,(n-1));++i)
                {
                if(stiva(i)==R)
                        { calcul();}

                }
       fprintf(g,"%ld\n",Max);
         }
int main()
        {
        read();
        solve();
        return 0;
        }