#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const int N = 5e4+4;

int n,K,B,ln;
ll a[N],b[N],c[N],f[N];

bool chk(ll x){
	int cnt=0;
	for (int i=1; i<=B && i<=n; i++){
		for (int j=1,k=n; j<=n; j++){
			while (k && a[i]+b[j]+c[k]>x){
				k--;
			}
			cnt+=k;
			if (cnt>=K) return 0;
		}
	}
	for (int i=B+1,j=ln; i<=n; i++){
		while (j && a[i]+f[j]>x){
			j--;
		}
		cnt+=j;
		if (cnt>=K) return 0;
	}
	return 1;
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin>>n>>K;
	B=sqrt(K/n)+1;
	ln=min(K/B+1ll,1ll*n*n);
	for (int i=1; i<=n; i++) cin>>a[i];
	for (int i=1; i<=n; i++) cin>>b[i];
	for (int i=1; i<=n; i++) cin>>c[i];
	sort(a+1,a+1+n);
	sort(b+1,b+1+n);
	sort(c+1,c+1+n);
	priority_queue<pair<ll,ll>,vector<pair<ll,ll>>,greater<pair<ll,ll>>> q;
	for (int i=1; i<=n; i++){
		q.push({b[i]+c[1],1});
	}
	for (int i=1; i<=ln; i++){
		auto x=q.top();
		q.pop();
		f[i]=x.first;
		if (x.second<n){
			q.push({x.first+c[x.second+1]-c[x.second],x.second+1});
		}
	}
	ll l=a[1]+b[1]+c[1]-1,r=a[n]+b[n]+c[n]+1;
	while (l+1<r){
		ll mid=l+r>>1;
		if (chk(mid)){
			l=mid;
		}
		else{
			r=mid;
		}
	}
	cout<<l+1<<"\n";
	return 0;
}

// TRY! TRY! TRY!

/*
Think twice before coding. Have you overkilled?
Think twice before submitting.
Check on the samples and constraints carefully.
*/

/*
Be brave to guess.
Is your former/first approach correct?
Follow your intuition.
Use a notebook to note down your ideas and check whether they are correct.
*/

/*
A simple brute force may work? There is some limit on the answer?
Try to find patterns.
*/