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)



tot=sum(p[:X])+sum(q[:Y])



a=0

b=0

for i in r:

    if a==X and b==Y:

        break

    elif a==X:

        if i>q[Y-b-1]:

            tot+=i-q[Y-b-1]

            b+=1

        else:

            break

    elif b==Y:

        if i>p[X-a-1]:

            tot+=i-p[X-a-1]

            a+=1

        else:

            break

    else:

        if i>p[X-a-1] and i>q[Y-b-1]:

            if p[X-a-1]<q[Y-b-1]:

                tot+=i-p[X-a-1]

                a+=1

            else:

                tot+=i-q[Y-b-1]

                b+=1

        elif i>p[X-a-1]:

            tot+=i-p[X-a-1]

            a+=1

        elif i>q[Y-b-1]:

            tot+=i-q[Y-b-1]

            b+=1

        else:

            break



print(tot)





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)



p=p[:X]

q=q[:Y]



z=p+q+r



z.sort(reverse=True)



tot=sum(z[:X+Y])



print(tot)





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)
tot = sum(p[:X]) + sum(q[:Y])
a = 0
b = 0
for i in r:
    if a == X and b == Y:
        break
    elif a == X:
        if i > q[Y - b - 1]:
            tot += i - q[Y - b - 1]
            b += 1
        else:
            break
    elif b == Y:
        if i > p[X - a - 1]:
            tot += i - p[X - a - 1]
            a += 1
        else:
            break
    else:
        if i > p[X - a - 1] and i > q[Y - b - 1]:
            if p[X - a - 1] < q[Y - b - 1]:
                tot += i - p[X - a - 1]
                a += 1
            else:
                tot += i - q[Y - b - 1]
                b += 1
        elif i > p[X - a - 1]:
            tot += i - p[X - a - 1]
            a += 1
        elif i > q[Y - b - 1]:
            tot += i - q[Y - b - 1]
            b += 1
        else:
            break
print(tot)

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)
p = p[:X]
q = q[:Y]
z = p + q + r
z.sort(reverse=True)
tot = sum(z[: X + Y])
print(tot)

-r.sort(reverse=True) -tot = sum(p[:X]) + sum(q[:Y]) -a = 0 -b = 0 -for i in r: -    if a == X and b == Y: -        break -    elif a == X: -        if i > q[Y - b - 1]: -            tot += i - q[Y - b - 1] -            b += 1 -        else: -            break -    elif b == Y: -        if i > p[X - a - 1]: -            tot += i - p[X - a - 1] -            a += 1 -        else: -            break -    else: -        if i > p[X - a - 1] and i > q[Y - b - 1]: -            if p[X - a - 1] < q[Y - b - 1]: -                tot += i - p[X - a - 1] -                a += 1 -            else: -                tot += i - q[Y - b - 1] -                b += 1 -        elif i > p[X - a - 1]: -            tot += i - p[X - a - 1] -            a += 1 -        elif i > q[Y - b - 1]: -            tot += i - q[Y - b - 1] -            b += 1 -        else: -            break +p = p[:X] +q = q[:Y] +z = p + q + r +z.sort(reverse=True) +tot = sum(z[: X + Y])