#include <fstream>
#include <algorithm>
#define nmax 1000

using namespace std;
ifstream fin("elimin.in");
ofstream fout("elimin.out");

int n,m,r,c;
int a[nmax][nmax];
int x[nmax],val,valm;
int mx;

void solve(int k)
{ int i,j; val++;
  int viz[nmax]={0};
  //for(i=1; i<=k; i++) fout<<x[i]<<" ";
  //fout<<"DA";
  for(i=1; i<=k; ++i) ///coloanele eliminate
      viz[x[i]]++;
  int b[nmax];
  int ct=0;
  for(i=1; i<=m; i++)
      {int sum=0;
       for(j=1; j<=n; j++)
          if(viz[j]==0) sum+=a[i][j];
       b[++ct]=sum;
      }
  sort(b+1,b+ct+1);
  //for(i=1; i<=n; i++) fout<<lin[i]<<" ";
  int sum_tot=0;
  //fout<<"NU";
  for(i=r+1;i<=n; i++) sum_tot+=b[i];
  if(sum_tot>mx) {mx=sum_tot;valm=val;}
}

void back(int k)
{ int i;
  for(i=x[k-1]+1; i<=n-c+k; ++i)
      { x[k]=i;
        if(k==c) {solve(k); //fout<<"\n";
                 }
        else back(k+1);
      }
}

int main()
{
  fin>>n>>m>>r>>c;
  int i,j;
  if(m>=n)
    {
        for(i=1;i<=m;i++)
        {
            for(j=1;j<=n;j++)
            {
                fin>>a[i][j];
            }
        }
    }
    else
    {
        for(i=1;i<=m;i++)
        {
            for(j=1;j<=n;j++)
            {
                fin>>a[j][i];
            }
        }
        swap(m,n);
        swap(r,c);
    }
  back(1);
  fout<<mx;//<<" "<<valm;

    return 0;
}