#include <bits/stdc++.h>
using namespace std;

#define int long long
#define fileio(name) if (fopen(name".inp", "r")) freopen(name".inp", "r", stdin), freopen(name".out", "w", stdout)

const int maxn = 50004;
int n, k, a[maxn], b[maxn], c[maxn];

int calc(int v) {
    int res = 0;
    for (int i = 1; i <= n; i++) {
        int add = 0;
        if (a[i] + b[n] + c[n] <= v) {
            add += n*n;
        } else {
            int l = 0;
            for (int j = n; j > 0; j--) {
                if (a[i] + b[j] + c[n] <= v) {
                    add += n*j;
                    break;
                } else {
                    while (l < n && a[i] + b[j] + c[l+1] <= v) l++;
                    add += l;
                }
            }
        }
        res += add;
        if (res + add*(n-i) < k) return 0;
        if (res >= k) return res;
    }
    return res;
}

int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    fileio("");
    // freopen("debug.txt", "w", stderr);

    cin >> n >> k;
    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);

    int l = 0, r = 3e9;
    while (l <= r) {
        int mid = l+(r-l)/2;
        if (calc(mid) >= k) {
            r = mid-1;
        } else {
            l = mid+1;
        }
    }
    cout << l;

    return 0 ^ 0;
}