info_num=gets.chomp.split(" ").map(&:to_i)
a=gets.chomp.split(" ").map(&:to_i)
b=gets.chomp.split(" ").map(&:to_i)
c=gets.chomp.split(" ").map(&:to_i)
def Quicksort(_arr,_l,_r)
	i=_l+1
	k=_r
	while i<k
		while _arr[i]>_arr[_l] and i<_r
			i+=1
		end
		while _arr[k]<=_arr[_l] and k>_l
			k-=1
		end
		if i<k
			w=_arr[i]
			_arr[i]=_arr[k]
			_arr[k]=w
		end
	end
	if _arr[_l]<_arr[k]
		w=_arr[_l]
		_arr[_l]=_arr[k]
		_arr[k]=w
	end
	if _l<k-1
		Quicksort(_arr,_l,k-1)
	end
	if k+1<_r
		Quicksort(_arr,k+1,_r)
	end
	return _arr
end
a=Quicksort(a,0,a.size-1)
b=Quicksort(b,0,b.size-1)
c=Quicksort(c,0,c.size-1)
anum=0
bnum=0
cnum=0
p a[0]+b[0]+c[0]
(info_num[3]-1).times do
	if(anum+1 !=info_num[0] and a[anum]-a[anum+1]<b[bnum]-b[bnum+1] and a[anum]-a[anum+1]<c[cnum]-c[cnum+1])
		anum+=1
		bnum-=1 if bnum!=0
		cnum-=1 if cnum!=0
	elsif bnum+1 !=info_num[1] and b[bnum]-b[bnum+1]<a[anum]-a[anum+1] and b[bnum]-b[bnum+1]<c[cnum]-c[cnum+1]
		bnum+=1
		anum-=1 if anum!=0
		cnum-=1 if cnum!=0
	elsif cnum+1 !=info_num[2]
		cnum+=1
		anum-=1 if anum!=0
		bnum-=1 if bnum!=0
	end
	p a[anum]+b[bnum]+c[cnum]
end