import heapq



X,Y,A,B,C = list(map(int,input().split()))

p=list(map(int,input().split()))

q=list(map(int,input().split()))

r=list(map(int,input().split()))

p.sort(reverse=True)

q.sort(reverse=True)

r.sort(reverse=True)



a=p[0:X]+q[0:Y]

heapq.heapify(a)



#print(a)

#print(a[0])



flag=True

while flag:

  if len(r)==0:

    flag=False

  elif a[0]<r[0]:

    heapq.heappop(a)

    heapq.heappush(a,r[0])

    r.pop(0)

  else:

    flag=False

print((sum(a)))
import heapq



X,Y,A,B,C=list(map(int,input().split()))

p=list(map(int,input().split()))

q=list(map(int,input().split()))

r=list(map(int,input().split()))

p.sort(reverse=True)

q.sort(reverse=True)

r.sort()



s = p[:X]+q[:Y]

ans=sum(s)

heapq.heapify(s)



while r and s:

    if s[0]<r[-1]:

        ans += r[-1]

        r.pop()

        ans -= heapq.heappop(s)

    else:

        break

print(ans)
import heapq

X, Y, A, B, C = list(map(int, input().split()))
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
a = p[0:X] + q[0:Y]
heapq.heapify(a)
# print(a)
# print(a[0])
flag = True
while flag:
    if len(r) == 0:
        flag = False
    elif a[0] < r[0]:
        heapq.heappop(a)
        heapq.heappush(a, r[0])
        r.pop(0)
    else:
        flag = False
print((sum(a)))

import heapq

X, Y, A, B, C = list(map(int, input().split()))
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort()
s = p[:X] + q[:Y]
ans = sum(s)
heapq.heapify(s)
while r and s:
    if s[0] < r[-1]:
        ans += r[-1]
        r.pop()
        ans -= heapq.heappop(s)
    else:
        break
print(ans)

-r.sort(reverse=True) -a = p[0:X] + q[0:Y] -heapq.heapify(a) -# print(a) -# print(a[0]) -flag = True -while flag: -    if len(r) == 0: -        flag = False -    elif a[0] < r[0]: -        heapq.heappop(a) -        heapq.heappush(a, r[0]) -        r.pop(0) +r.sort() +s = p[:X] + q[:Y] +ans = sum(s) +heapq.heapify(s) +while r and s: +    if s[0] < r[-1]: +        ans += r[-1] +        r.pop() +        ans -= heapq.heappop(s) -        flag = False -print((sum(a))) +        break +print(ans)