from heapq import heapify, heappop

import sys

read = sys.stdin.read

readline = sys.stdin.readline

readlines = sys.stdin.readlines



def main():

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

    p = [-int(i) for i in readline().split()]

    q = [-int(i) for i in readline().split()]

    r = [-int(i) for i in readline().split()]



    p = sorted(p)[:X]

    q = sorted(q)[:Y]

    r.sort()

    

    Q = p + q + r

    heapify(Q)



    ans = 0

    for i in range(X+Y):

        ans -= heappop(Q)

        

    print(ans)





if __name__ == "__main__":

    main()

import sys

read = sys.stdin.read

readline = sys.stdin.readline

readlines = sys.stdin.readlines



def main():

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

    p = [int(i) for i in readline().split()]

    q = [int(i) for i in readline().split()]

    r = [int(i) for i in readline().split()]



    p.sort()

    q.sort()

    r.sort()

    

    Q = p[A-X:] + q[B-Y:] + r

    Q.sort(reverse=True)

    ans = sum(Q[:X+Y])



    print(ans)





if __name__ == "__main__":

    main()

from heapq import heapify, heappop
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines


def main():
    X, Y, A, B, C = list(map(int, readline().split()))
    p = [-int(i) for i in readline().split()]
    q = [-int(i) for i in readline().split()]
    r = [-int(i) for i in readline().split()]
    p = sorted(p)[:X]
    q = sorted(q)[:Y]
    r.sort()
    Q = p + q + r
    heapify(Q)
    ans = 0
    for i in range(X + Y):
        ans -= heappop(Q)
    print(ans)


if __name__ == "__main__":
    main()

import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines


def main():
    X, Y, A, B, C = list(map(int, readline().split()))
    p = [int(i) for i in readline().split()]
    q = [int(i) for i in readline().split()]
    r = [int(i) for i in readline().split()]
    p.sort()
    q.sort()
    r.sort()
    Q = p[A - X :] + q[B - Y :] + r
    Q.sort(reverse=True)
    ans = sum(Q[: X + Y])
    print(ans)


if __name__ == "__main__":
    main()

-from heapq import heapify, heappop -    p = [-int(i) for i in readline().split()] -    q = [-int(i) for i in readline().split()] -    r = [-int(i) for i in readline().split()] -    p = sorted(p)[:X] -    q = sorted(q)[:Y] +    p = [int(i) for i in readline().split()] +    q = [int(i) for i in readline().split()] +    r = [int(i) for i in readline().split()] +    p.sort() +    q.sort() -    Q = p + q + r -    heapify(Q) -    ans = 0 -    for i in range(X + Y): -        ans -= heappop(Q) +    Q = p[A - X :] + q[B - Y :] + r +    Q.sort(reverse=True) +    ans = sum(Q[: X + Y])