#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, k, B, D, cnt = 0, a[50010], b[50010], c[50010], d[50010], f[7100010];
struct Node{
	int id, x;
	bool operator <(const Node u) const{ return x > u.x; }
};
priority_queue <Node> q;
bool chk(ll x){
	int i, j, p;
	ll res = 0;
	for(i = 1; i <= B; i++){
		for(j = 1, p = n; j <= n; j++){
			while(p > 0 && (ll)a[i] + b[j] + c[p] > x) p--;
			res += p;
		}
	}
	for(j = cnt; i <= n; i++){
		while(j > 0 && (ll)a[i] + f[j] > x) j--;
		res += j;
	}
	return res >= k;
}
int main()
{
	int i;
	ll l, r, md;
	scanf("%d%d", &n, &k);
	B = min(n, max((int)sqrt(k / n), 1)); D = k / B;
	for(i = 1; i <= n; i++) scanf("%d", &a[i]);
	for(i = 1; i <= n; i++) scanf("%d", &b[i]);
	for(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);
	if(B < n){
		for(i = 1; i <= n; i++) d[i] = 1, q.push({i, b[i] + c[1]});
		while(cnt < D && q.size() > 0){
			i = q.top().id; q.pop();
			f[++cnt] = b[i] + c[d[i]++];
			if(d[i] <= n) q.push({i, b[i] + c[d[i]]});
		}
	}
	l = (ll)a[1] + b[1] + c[1]; r = (ll)a[n] + b[n] + c[n];
	while(l < r){
		md = l + r >> 1;
		if(chk(md)) r = md;
		else l = md + 1;
	}
	printf("%lld", l);
	return 0;
}