#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll,int> pii;

const int maxn=5e4+5;
const int maxm=4e6+5;
int a[maxn],b[maxn],c[maxn],d[maxm],cnt=0;
int pos[maxn];
priority_queue<pii> que;

int main(){
	
	int n,k,blk;
	
	scanf("%d %d",&n,&k);
	for(int i=1;i<=n;i++) scanf("%d",&a[i]);
	for(int i=1;i<=n;i++) scanf("%d",&b[i]);
	for(int i=1;i<=n;i++) scanf("%d",&c[i]);
	
	sort(a+1,a+n+1);
	sort(b+1,b+n+1);
	sort(c+1,c+n+1);
	
	blk=sqrt(1ll*n*k);
	
	for(int i=1;i<=n;i++){
		que.push(make_pair(-(b[i]+c[1]),i));
		pos[i]=1;
	}
	
	while(cnt<blk&&(!que.empty())){
		int x=que.top().second;
		que.pop();
		d[++cnt]=b[x]+c[pos[x]];
		pos[x]++;
		if(pos[x]<=n) que.push(make_pair(-(b[x]+c[pos[x]]),x));
	}
	
	ll l=0,r=1ll*a[n]+b[n]+c[n],ret;
	
	while(l<=r){
		ll mid=(l+r)>>1;
		int t=upper_bound(a+1,a+n+1,mid-d[cnt])-a-1;
		if(1ll*t*cnt>=mid){
			ret=mid;
			r=mid-1;
			continue;
		}
		ll sum=0;
		int now=n;
		for(int i=1;i<=cnt&&sum<k&&now>t;i++){
			while(now>t&&1ll*d[i]+a[now]>mid) now--;
			sum+=(now-t);
		}
		for(int i=1;i<=t&&sum<k;i++){
			now=n;
			for(int j=1;j<=n&&now&&sum<k;j++){
				while(now&&1ll*a[i]+b[i]+c[now]>mid) now--;
				sum+=now;
			}
		}
		if(sum>=k){
			ret=mid;
			r=mid-1;
		}else l=mid+1;
	}
	
	printf("%lld\n",ret);
	
	return 0;
}