x,y,a,b,c=list(map(int,input().split()))

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

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

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

A.sort(reverse=True)

A.sort()

B.sort()

C.sort(reverse=True)

A=A[a-x:]

B=B[b-y:]



i=0

j=0

k=0

lea=len(A)

leb=len(B)

while(True):

    if len(C)<1:

        break

    if i<lea and j<leb:

        if A[i]>B[j]:

            if B[j]<C[0]:

                B[j]=C.pop(0)

                

                j+=1

            else:

                break

        else:

            if A[i]<C[0]:

                A[i]=C.pop(0)

                i+=1

            else:

                break

    elif i<lea and j>=leb:

        if A[i]<C[0]:

                A[i]=C.pop(0)

                i+=1

        else:

            break

    elif i>=lea and j<leb:

        if B[j]<C[0]:

                B[j]=C.pop(0)

                j+=1

        else:

            break

    else:

        break

sum=0





for s in range(len(A)):

    sum+=A[s]

for t in range(len(B)):

    sum+=B[t]

print(sum)

            



x,y,a,b,c=list(map(int,input().split()))

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

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

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

A.sort(reverse=True)

A.sort()

B.sort()

A=A[a-x:]

B=B[b-y:]

D=A+B+C

D.sort(reverse=True)

sum=0

for i in range(x+y):

    sum+=D[i]

print(sum)



x, y, a, b, c = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort(reverse=True)
A.sort()
B.sort()
C.sort(reverse=True)
A = A[a - x :]
B = B[b - y :]
i = 0
j = 0
k = 0
lea = len(A)
leb = len(B)
while True:
    if len(C) < 1:
        break
    if i < lea and j < leb:
        if A[i] > B[j]:
            if B[j] < C[0]:
                B[j] = C.pop(0)
                j += 1
            else:
                break
        else:
            if A[i] < C[0]:
                A[i] = C.pop(0)
                i += 1
            else:
                break
    elif i < lea and j >= leb:
        if A[i] < C[0]:
            A[i] = C.pop(0)
            i += 1
        else:
            break
    elif i >= lea and j < leb:
        if B[j] < C[0]:
            B[j] = C.pop(0)
            j += 1
        else:
            break
    else:
        break
sum = 0
for s in range(len(A)):
    sum += A[s]
for t in range(len(B)):
    sum += B[t]
print(sum)

x, y, a, b, c = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort(reverse=True)
A.sort()
B.sort()
A = A[a - x :]
B = B[b - y :]
D = A + B + C
D.sort(reverse=True)
sum = 0
for i in range(x + y):
    sum += D[i]
print(sum)

-C.sort(reverse=True) -i = 0 -j = 0 -k = 0 -lea = len(A) -leb = len(B) -while True: -    if len(C) < 1: -        break -    if i < lea and j < leb: -        if A[i] > B[j]: -            if B[j] < C[0]: -                B[j] = C.pop(0) -                j += 1 -            else: -                break -        else: -            if A[i] < C[0]: -                A[i] = C.pop(0) -                i += 1 -            else: -                break -    elif i < lea and j >= leb: -        if A[i] < C[0]: -            A[i] = C.pop(0) -            i += 1 -        else: -            break -    elif i >= lea and j < leb: -        if B[j] < C[0]: -            B[j] = C.pop(0) -            j += 1 -        else: -            break -    else: -        break +D = A + B + C +D.sort(reverse=True) -for s in range(len(A)): -    sum += A[s] -for t in range(len(B)): -    sum += B[t] +for i in range(x + y): +    sum += D[i]