import sys

import heapq



read = sys.stdin.buffer.read

readline = sys.stdin.buffer.readline

readlines = sys.stdin.buffer.readlines



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



P = list(map(int, readline().split()))

Q = list(map(int, readline().split()))

R = list(map(int, readline().split()))



P = sorted(P, reverse=True)[:X]

Q = sorted(Q, reverse=True)[:Y]

R.sort(reverse=True)



heapq.heapify(P)

heapq.heapify(Q)



for r in R:

    p = heapq.heappop(P)

    q = heapq.heappop(Q)



    if p <= q and p < r:

        heapq.heappush(P, r)

        heapq.heappush(Q, q)

    elif q < r:

        heapq.heappush(Q, r)

        heapq.heappush(P, p)

    else:

        heapq.heappush(P, p)

        heapq.heappush(Q, q)



print((sum(P) + sum(Q)))
import sys

read = sys.stdin.buffer.read

readline = sys.stdin.buffer.readline

readlines = sys.stdin.buffer.readlines



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



P = sorted(list(map(int, readline().split())),reverse=True)

Q = sorted(list(map(int, readline().split())),reverse=True)

R = sorted(list(map(int, readline().split())),reverse=True)



lis = P[:X] + Q[:Y] + R



print((sum(sorted(lis,reverse=True)[:X+Y])))
import sys
import heapq

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
X, Y, A, B, C = list(map(int, readline().split()))
P = list(map(int, readline().split()))
Q = list(map(int, readline().split()))
R = list(map(int, readline().split()))
P = sorted(P, reverse=True)[:X]
Q = sorted(Q, reverse=True)[:Y]
R.sort(reverse=True)
heapq.heapify(P)
heapq.heapify(Q)
for r in R:
    p = heapq.heappop(P)
    q = heapq.heappop(Q)
    if p <= q and p < r:
        heapq.heappush(P, r)
        heapq.heappush(Q, q)
    elif q < r:
        heapq.heappush(Q, r)
        heapq.heappush(P, p)
    else:
        heapq.heappush(P, p)
        heapq.heappush(Q, q)
print((sum(P) + sum(Q)))

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
X, Y, A, B, C = list(map(int, readline().split()))
P = sorted(list(map(int, readline().split())), reverse=True)
Q = sorted(list(map(int, readline().split())), reverse=True)
R = sorted(list(map(int, readline().split())), reverse=True)
lis = P[:X] + Q[:Y] + R
print((sum(sorted(lis, reverse=True)[: X + Y])))

-import heapq -P = list(map(int, readline().split())) -Q = list(map(int, readline().split())) -R = list(map(int, readline().split())) -P = sorted(P, reverse=True)[:X] -Q = sorted(Q, reverse=True)[:Y] -R.sort(reverse=True) -heapq.heapify(P) -heapq.heapify(Q) -for r in R: -    p = heapq.heappop(P) -    q = heapq.heappop(Q) -    if p <= q and p < r: -        heapq.heappush(P, r) -        heapq.heappush(Q, q) -    elif q < r: -        heapq.heappush(Q, r) -        heapq.heappush(P, p) -    else: -        heapq.heappush(P, p) -        heapq.heappush(Q, q) -print((sum(P) + sum(Q))) +P = sorted(list(map(int, readline().split())), reverse=True) +Q = sorted(list(map(int, readline().split())), reverse=True) +R = sorted(list(map(int, readline().split())), reverse=True) +lis = P[:X] + Q[:Y] + R +print((sum(sorted(lis, reverse=True)[: X + Y])))