#include <stdio.h>
#define lim 700
int max=0,i,j,k,n,m,r,c;
int a[lim][lim];
int fol[lim],s[lim];
int main()
{

    freopen("elimin.in","r",stdin);
    freopen("elimin.out","w",stdout);
    
    scanf("%d%d%d%d",&m,&n,&r,&c);
    for (i=1; i<=n; i++)
        for (j=1; j<=m; j++)
            scanf("%d",&a[i][j]);
    
	if (m<=n)
    {
       for (k=0; k<=(1<<m)-1; k++)
       {
		   for (i=1; i<=m; i++)
			   fol[i]=0;

		   int nr=0;
		   for (i=0; i<=m-1; i++)
			   if (k&(i<<1)) nr++;

		   if (nr==c)
		   {
			   for (i=0; i<=m-1; i++)
				   if(k&(i<<1)) fol[i]=1;

			   for (i=1; i<=n; i++)
			   {
				   s[i]=0;
				   for (j=1; j<=m; j++)
					   if (fol[j]==0) s[i]+=a[i][j];
			   }
			   for (i=1; i<=n-1; i++)
				   for (j=i+1; j<=n; j++)
					  if (s[i]>s[j])
					  {
						int x=s[i];
						s[i]=s[j];
						s[j]=x;
					  }
			   int sum=0;
			   for (i=r+1; i<=n; i++)
					sum+=s[i];
			   if (sum>max) max=sum;
		   }
	   }
	}
	else
	{
	   for (k=0; k<=(1<<n)-1; k++)
	   {
		   for (i=1; i<=n; i++)
			   fol[i]=0;

		   int nr=0;
		   for (i=0; i<=n-1; i++)
			   if (k&(i<<1)) nr++;

		   if (nr==c)
		   {
			   for (i=0; i<=n-1; i++)
				   if(k&(i<<1)) fol[i]=1;

			   for (i=1; i<=m; i++)
			   {
				   s[i]=0;
				   for (j=1; j<=n; j++)
					   if (fol[j]==0) s[i]+=a[i][j];
			   }
			   for (i=1; i<=m-1; i++)
				   for (j=i+1; j<=m; j++)
					  if (s[i]>s[j])
					  {
						int x=s[i];
						s[i]=s[j];
						s[j]=x;
					  }
			   int sum=0;
			   for (i=r+1; i<=m; i++)
					sum+=s[i];
			   if (sum>max) max=sum;
		   }
	   }
	}
    printf("%d\n",max);                         
        
    
    
    return 0;    
}