#include <stdio.h>

#define nmax 32
#define mmax 8192

int u,p,q,max=0,i,j,k,n,m,r,c,nr,co;
int s[mmax],o[mmax];
void inter(int p, int q)
{
     int r=(p+q)>>1,x,y,k=0,i;
     x=p;y=r+1;
     while (x<=r && y<=q)     
     {
         k++;
         if (s[x]<s[y])      
         {
            o[k]=s[x];++x;
         }
         else
         {
            o[k]=s[y];++y;    
         }
     }
     while (x<=r)
     {
         ++k;o[k]=s[x];++x;      
     }
     while (y<=q)
     {
         ++k;o[k]=s[y];++y;      
     }
     k=0;
     for (i=p; i<=q; ++i)
     {
         ++k;s[i]=o[k];    
     }

}     
void merge(int p, int q)
{
     int r=(p+q)>>1;
     if (p==q) return;
     merge(p,r);
     merge(r+1,q);    
     inter(p,q);
     if (p+1>=q) return;
}
int main()
{
    int a[nmax][mmax];
    int fol[nmax];

	freopen("elimin.in","r",stdin);
	freopen("elimin.out","w",stdout);

	scanf("%d%d%d%d",&n,&m,&r,&c);
    if (n<=m)
	for (i=1; i<=n; ++i)
		for (j=1; j<=m; ++j)
			scanf("%d",&a[i][j]);
    else
    {
		p=1;q=0;
		for (i=1; i<=n; ++i)
			for (j=1; j<=n; ++j)
			{
				if (q<m) ++q;
				else { ++p;q=1;}
				scanf("%d",&a[q][p]);
			}
		k=n;n=m;m=k;k=r;r=c;c=k;
	}
       u=(1<<n)-1;
	   for (k=0; k<=u; ++k)
	   {
		   for (i=1; i<=n; ++i)
			   fol[i]=0;

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

		   if (nr==r)
		   {
			   for (i=1; i<=m; ++i)
				  s[i]=0;

			   for (j=1; j<=m; ++j)
			   {
				   s[j]=0;
				   for (i=1; i<=n; ++i)
						if (fol[i]==0) s[j]+=a[i][j];
			   }

               merge(1,m);  
			   int sum=0;
			   for (i=c+1; i<=m; ++i)
					sum+=s[i];
			   if (sum>max) max=sum;
		   }
	   }

	printf("%d\n",max);
        
    
    
    return 0;    
}