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

Ap = list([(int(x), 0) for x in input().split()])

Bq = list([(int(x), 1) for x in input().split()])

Cr = list([(int(x), 2) for x in input().split()])



INF = 2 * 10**5 + 1



L = Ap + Bq + Cr

L.sort(reverse = True)



cnt = [0, 0, 0]

cntM = [X, Y, INF]

s = 0



ans = 0



for x, i in L:

  if s == X + Y:

    break

  elif cnt[i] < cntM[i]:

    ans += x

    cnt[i] += 1

    s += 1

  else:

    pass



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

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

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

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



Ap.sort(reverse = True)

Bq.sort(reverse = True)



L = sorted(Ap[:X] + Bq[:Y] + Cr, reverse = True)



print((sum(L[:X+Y])))
X, Y, A, B, C = list(map(int, input().split()))
Ap = list([(int(x), 0) for x in input().split()])
Bq = list([(int(x), 1) for x in input().split()])
Cr = list([(int(x), 2) for x in input().split()])
INF = 2 * 10**5 + 1
L = Ap + Bq + Cr
L.sort(reverse=True)
cnt = [0, 0, 0]
cntM = [X, Y, INF]
s = 0
ans = 0
for x, i in L:
    if s == X + Y:
        break
    elif cnt[i] < cntM[i]:
        ans += x
        cnt[i] += 1
        s += 1
    else:
        pass
print(ans)

X, Y, A, B, C = list(map(int, input().split()))
Ap = list(map(int, input().split()))
Bq = list(map(int, input().split()))
Cr = list(map(int, input().split()))
Ap.sort(reverse=True)
Bq.sort(reverse=True)
L = sorted(Ap[:X] + Bq[:Y] + Cr, reverse=True)
print((sum(L[: X + Y])))

-Ap = list([(int(x), 0) for x in input().split()]) -Bq = list([(int(x), 1) for x in input().split()]) -Cr = list([(int(x), 2) for x in input().split()]) -INF = 2 * 10**5 + 1 -L = Ap + Bq + Cr -L.sort(reverse=True) -cnt = [0, 0, 0] -cntM = [X, Y, INF] -s = 0 -ans = 0 -for x, i in L: -    if s == X + Y: -        break -    elif cnt[i] < cntM[i]: -        ans += x -        cnt[i] += 1 -        s += 1 -    else: -        pass -print(ans) +Ap = list(map(int, input().split())) +Bq = list(map(int, input().split())) +Cr = list(map(int, input().split())) +Ap.sort(reverse=True) +Bq.sort(reverse=True) +L = sorted(Ap[:X] + Bq[:Y] + Cr, reverse=True) +print((sum(L[: X + Y])))