#include<bits/stdc++.h>
using namespace std;using ll=long long;using pii=pair<int,int>;
const int M=998244353,P=5e4,N=P+5,K=1e3,lim=1e6,G=P;const ll inf=1e17;
struct S
{
	int n,K;vector<vector<ll>>a,pre;
    bool trial(ll val)//first >=k_count:val<=
    {
        ll res=0;
        for(int i=0;i<3;i++)
        {
            auto&va=a[i];auto&vp=pre[i];
            for(int pa=(i==0?1:K+1),pp=K*K;pa<=n;pa++)
            {
                while(pp&&va[pa]+vp[pp]>val)pp--;
                res+=pp;//cout<<pa<<"%"<<pp<<'\n';
            }
        }
        for(int z=0;z<3;z++,swap(a[0],a[1]),swap(a[1],a[2]))//i<=K,j&k>K
        {
            for(int i=1;i<=1000;i++)
            {
                int lim=min(int(1e9)/(K+1)/i,P);ll vl=val-a[0][i];
                for(int j=K+1,k=lim;j<=lim&&k>K;)
                {
                    if(a[1][j]+a[2][k]<=vl)j++,res+=k-K;
                    else k--;
                }
            }
        }
        //cout<<val<<"%"<<res<<'\n';
        return res>=K;
    }
    void solve()
	{
        /*j,k>1000,i precal
        {
            int sum=0;for(int i=1;i<=1000;i++)sum+=max(min(lim/i,G)-1000,0);
            cout<<sum<<'\n';
            //3887282+1e6 presort
        }*/
        cin>>n>>K;a.resize(3,vector<ll>(N+1,inf));pre.resize(3,vector<ll>(1,0));
        for(int i=0;i<3;i++){for(int j=1;j<=n;j++)cin>>a[i][j];sort(a[i].begin()+1,a[i].begin()+n+1);}
        for(int i=0;i<3;i++)
        {
            auto&v0=pre[i];auto&v1=a[(i+1)%3];auto&v2=a[(i+2)%3];
            for(int j=1;j<=K;j++)for(int k=1;k<=K;k++)v0.push_back(v1[j]+v2[k]);
            sort(v0.begin()+1,v0.end());
        }
        ll L=0,R=3.1e9;//3.1e9
        while(R-L>1){ll mid=L+R>>1;trial(mid)?R=mid:L=mid;}cout<<R<<'\n';
    }
};
void precal(){}
int main()
{
	ios::sync_with_stdio(0);cin.tie(0);precal();
	int t=1;//cin>>t;
	while(t--){S SS;SS.solve();}
}