#include<stdio.h>
#include<algorithm>
#define NMAX 807
using namespace std;
int m,n,r,c,sol,sum,a[NMAX][NMAX],v[37],s[NMAX];
void back(int x,int y)
{
    int i,j;
	if(x==r+1)
	{
		for(i=1;i<=n;++i)
			for(j=1;j<=m;++j)
				s[j]+=a[i][j]*v[i];
		sort(s+1,s+m+1);
		for(i=m;i>c;--i)
			sum+=s[i];
		if(sum>sol)
			sol=sum;
		sum=0;
		for(i=1;i<=m;++i)
			s[i]=0;
		return;
	}
	for(i=y+1;i<=n-r+x;++i)
	{
		v[i]=0;
		back(x+1,i);
		v[i]=1;
	}
}
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)
	{
	    //caz 1
		for(i=1;i<=n;++i)
		{
			for(j=1;j<=m;++j)
				scanf("%d",&a[i][j]);
			v[i]=1;
		}
	}
	else
	{
	    //caz 2
		for(i=1;i<=n;++i)
			for(j=1;j<=m;++j)
				scanf("%d",&a[j][i]);
		swap(m,n);
		swap(r,c);
	}
	back(1,0);
	printf("%d\n",sol);
	return 0;
}