import sys

import numpy as np

sys.setrecursionlimit(10 ** 6)

input = sys.stdin.readline

X, Y, A, B, C = [int(x) for x in input().strip().split()]

p = np.array(sorted([int(x) for x in input().strip().split()], reverse=True))[:X]

q = np.array(sorted([int(x) for x in input().strip().split()], reverse=True))[:Y]

r = np.array(sorted([int(x) for x in input().strip().split()], reverse=True))[:min(C, X+Y)]



pq = np.hstack((p, q))

pq.sort()

ri = 0

for i, t in enumerate(pq):

    if t < r[ri]:

        pq[i] = r[ri]

        ri += 1

    if ri == len(r):

        break

print((sum(pq)))
import sys

import numpy as np

sys.setrecursionlimit(10 ** 6)

input = sys.stdin.readline

X, Y, A, B, C = [int(x) for x in input().strip().split()]

p = np.array(sorted([int(x) for x in input().strip().split()], reverse=True))[:X]

q = np.array(sorted([int(x) for x in input().strip().split()], reverse=True))[:Y]

r = np.array(sorted([int(x) for x in input().strip().split()], reverse=True))[:min(C, X+Y)]



pq = np.hstack((p, q, r))

pq.sort()

print((sum(pq[-(X+Y):])))
import sys
import numpy as np

sys.setrecursionlimit(10**6)
input = sys.stdin.readline
X, Y, A, B, C = [int(x) for x in input().strip().split()]
p = np.array(sorted([int(x) for x in input().strip().split()], reverse=True))[:X]
q = np.array(sorted([int(x) for x in input().strip().split()], reverse=True))[:Y]
r = np.array(sorted([int(x) for x in input().strip().split()], reverse=True))[
    : min(C, X + Y)
]
pq = np.hstack((p, q))
pq.sort()
ri = 0
for i, t in enumerate(pq):
    if t < r[ri]:
        pq[i] = r[ri]
        ri += 1
    if ri == len(r):
        break
print((sum(pq)))

import sys
import numpy as np

sys.setrecursionlimit(10**6)
input = sys.stdin.readline
X, Y, A, B, C = [int(x) for x in input().strip().split()]
p = np.array(sorted([int(x) for x in input().strip().split()], reverse=True))[:X]
q = np.array(sorted([int(x) for x in input().strip().split()], reverse=True))[:Y]
r = np.array(sorted([int(x) for x in input().strip().split()], reverse=True))[
    : min(C, X + Y)
]
pq = np.hstack((p, q, r))
pq.sort()
print((sum(pq[-(X + Y) :])))

-pq = np.hstack((p, q)) +pq = np.hstack((p, q, r)) -ri = 0 -for i, t in enumerate(pq): -    if t < r[ri]: -        pq[i] = r[ri] -        ri += 1 -    if ri == len(r): -        break -print((sum(pq))) +print((sum(pq[-(X + Y) :])))