import heapq



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



def max_listup(limit):

  l = list([int(x)*-1 for x in input().split()])

  heapq.heapify(l)

  cnt = 1

  res = []

  while l:

    if cnt > limit:

      break

    m = heapq.heappop(l)

    res.append(m*-1)

    cnt += 1

  return res



if __name__ == "__main__":

  all = sorted(max_listup(x) + max_listup(y) + list(map(int, input().split())))

  ans = 0

  for _ in range(x+y):

    ans += all.pop()



  print(ans)

import heapq



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



def max_listup(limit):

  l = sorted(list(map(int, input().split())))

  cnt = 1

  res = []

  while l:

    if cnt > limit:

      break

    m = l.pop()

    res.append(m)

    cnt += 1

  return res



if __name__ == "__main__":

  all = sorted(max_listup(x) + max_listup(y) + list(map(int, input().split())))

  ans = 0

  for _ in range(x+y):

    ans += all.pop()



  print(ans)

import heapq

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


def max_listup(limit):
    l = list([int(x) * -1 for x in input().split()])
    heapq.heapify(l)
    cnt = 1
    res = []
    while l:
        if cnt > limit:
            break
        m = heapq.heappop(l)
        res.append(m * -1)
        cnt += 1
    return res


if __name__ == "__main__":
    all = sorted(max_listup(x) + max_listup(y) + list(map(int, input().split())))
    ans = 0
    for _ in range(x + y):
        ans += all.pop()
    print(ans)

import heapq

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


def max_listup(limit):
    l = sorted(list(map(int, input().split())))
    cnt = 1
    res = []
    while l:
        if cnt > limit:
            break
        m = l.pop()
        res.append(m)
        cnt += 1
    return res


if __name__ == "__main__":
    all = sorted(max_listup(x) + max_listup(y) + list(map(int, input().split())))
    ans = 0
    for _ in range(x + y):
        ans += all.pop()
    print(ans)

-    l = list([int(x) * -1 for x in input().split()]) -    heapq.heapify(l) +    l = sorted(list(map(int, input().split()))) -        m = heapq.heappop(l) -        res.append(m * -1) +        m = l.pop() +        res.append(m)