import sys

input = sys.stdin.readline

from heapq import *



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)

pq = []

ans = 0



for i in range(X):

    heappush(pq, p[i])

    ans += p[i]



for i in range(Y):

    heappush(pq, q[i])

    ans += q[i]



r.sort(reverse=True)

now = ans



for i in range(C):

    now -= heappop(pq)

    heappush(pq, r[i])

    now += r[i]

    ans = max(ans, now)



print(ans)
import sys

input = sys.stdin.readline



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)

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

l.sort()

s = sum(l)

ans = s

pre = s



for i in range(min(len(l), C)):

    ans = max(ans, pre-l[i]+r[i])

    pre = pre-l[i]+r[i]



print(ans)
import sys

input = sys.stdin.readline
from heapq import *

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)
pq = []
ans = 0
for i in range(X):
    heappush(pq, p[i])
    ans += p[i]
for i in range(Y):
    heappush(pq, q[i])
    ans += q[i]
r.sort(reverse=True)
now = ans
for i in range(C):
    now -= heappop(pq)
    heappush(pq, r[i])
    now += r[i]
    ans = max(ans, now)
print(ans)

import sys

input = sys.stdin.readline
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)
l = p[:X] + q[:Y]
l.sort()
s = sum(l)
ans = s
pre = s
for i in range(min(len(l), C)):
    ans = max(ans, pre - l[i] + r[i])
    pre = pre - l[i] + r[i]
print(ans)

-from heapq import * - -pq = [] -ans = 0 -for i in range(X): -    heappush(pq, p[i]) -    ans += p[i] -for i in range(Y): -    heappush(pq, q[i]) -    ans += q[i] -now = ans -for i in range(C): -    now -= heappop(pq) -    heappush(pq, r[i]) -    now += r[i] -    ans = max(ans, now) +l = p[:X] + q[:Y] +l.sort() +s = sum(l) +ans = s +pre = s +for i in range(min(len(l), C)): +    ans = max(ans, pre - l[i] + r[i]) +    pre = pre - l[i] + r[i]