#include<stdio.h>   
#include<stdlib.h>   
int n,m,l,c,v[550],nr[500][500],r;
char s[20];
void solv1(int i,int j){
	int aux;
	aux=v[i];
	v[i]=v[j];
	v[j]=aux;
}
void solv2(int i,int n){
	int max=i;
	if(2*i<=n&&v[max]<v[2*i])
		max=2*i;
	if(2*i+1<=n&&v[max]<v[2*i+1])
		max=2*i+1;
	if(i!=max){
		solv1(i,max);
		solv2(max,n);
	}
}
void sort(){
	int i;
	for(i=n/2;i>=1;--i)
		solv2(i,n);
	for(i=n;i>1;--i){
		solv1(1,i);
		solv2(1,i-1);
	}
}
void back(int poz,int val){
	if(poz<=m+1)
		if(val==c){
			int i,j;
			for(i=1;i<=n;++i){
				v[i]=0;
				for(j=1;j<=m;++j){
					if(!s[j])
						v[i]+=nr[i][j];
				}
			}
			sort();
			j=0;
			for(i=l+1;i<=n;++i)
				j+=v[i];
			if(j>r)
				r=j;
		}
		else{
			s[poz]=1;
			back(poz+1,val+1);
			s[poz]=0;
			back(poz+1,val);
		}
}
int main(){
	freopen("elimin.in","r",stdin);
	freopen("elimin.out","w",stdout);
	int i,j;
	scanf("%d%d%d%d",&n,&m,&l,&c);
	r=-1000000;
	for(i=1;i<=n;++i){
			for(j=1;j<=m;++j)
				scanf("%d",&nr[i][j]);
	}
	back(1,0);
	printf("%d\n",r);
	fclose(stdin);
	fclose(stdout);
	return 0;
}