#include<cstdio>
#include<algorithm>
using namespace std;
#define N 5000
typedef struct pe
{int y,t;};
pe q[N];
int n,m,i,j,a[20][N],r,c,k,x,s[N],d,u,b[20][N],l;

int cmp(pe a,pe b)
{return a.t<b.t;}

int main()
{FILE *f=fopen("elimin.in","r"),*g=fopen("elimin.out","w");
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[j][i]);
     x=n,n=m,m=x,x=r,r=c,c=x;}
else
     for(i=1;i<=n;i++)
     for(j=1;j<=m;j++)
            fscanf(f,"%d",&a[i][j]);
if(r)
     for(k=1;k;)
            {s[k]++;
            if(s[k]<=n-r+k)
                   if(k==r)
                           {for(i=l=1;i<=n&&l<=r;)
                           if(i==s[l])
                                  {for(j=1;j<=m;j++)
                                         b[i][j]=0;
                                  i++,l++;}
                           else
                                  {for(j=1;j<=m;j++)
                                         b[i][j]=a[i][j];
                                  if(i<s[l])
                                         i++;
                                  else
                                         l++;}
                           if(c)
                                  {for(i=1;i<=m;i++)
                                        q[i].t=0,q[i].y=i;
                                  for(i=1;i<=n;i++)
                                  for(j=1;j<=m;j++)
                                        q[j].t+=b[i][j];
                                  sort(q+1,q+m+1,cmp);
                                  for(i=1;i<=n;i++)
                                  for(j=1;j<=c;j++)
                                         b[i][q[j].y]=0;}
                           for(i=1,d=0;i<=n;i++)
                           for(j=1;j<=m;j++)
                                  d+=b[i][j];
                           if(d>u)
                                  u=d;}
                   else
                           k++,s[k]=s[k-1];
            else
                   k--;}
else
     {if(c)
            {for(i=1;i<=m;i++)
                   q[i].t=0,q[i].y=i;
            for(i=1;i<=n;i++)
            for(j=1;j<=m;j++)
                   q[j].t+=a[i][j];
            sort(q+1,q+m+1,cmp);
            for(i=1;i<=n;i++)
            for(j=1;j<=c;j++)
                   a[i][q[j].y]=0;}
     for(i=1;i<=n;i++)
     for(j=1;j<=m;j++)
            u+=a[i][j];}
fprintf(g,"%d",u);
return 0;}