program ABC160E2
    implicit none
    integer(8)::X,Y,A,B,C,i,ans
    integer(8),allocatable,dimension(:)::P,Q,R
    read*,X,Y,A,B,C
    ans=0

    allocate(P(A))
    allocate(Q(B))
    allocate(R(C+X+Y))
    read*,P,Q,(R(i),i=1,C)
    call heapsort(A,P)
    call heapsort(B,Q)

    do i=0,X-1
        R(C+i+1)=P(A-i)
    end do

    do i=0,Y-1
        R(C+X+i+1)=Q(B-i)
    end do
    call heapsort(C+X+Y,R)

    do i=0,X+Y-1
        ans=ans+R(C+X+Y-i)
    end do

    print'(i0)',ans
end program ABC160E2

subroutine heapsort(n,array)
    implicit none
    integer(8),intent(in) :: n
    integer(8),intent(inout) :: array(1:n)
   
    integer(8) ::i,k,j,l
    integer(8) :: t
   
    if(n.eq.1)return
  
    l=n/2+1
    k=n
    do while(k.ne.1)
       if(l.gt.1)then
          l=l-1
          t=array(L)
       else
          t=array(k)
          array(k)=array(1)
          k=k-1
          if(k.eq.1) then
             array(1)=t
             exit
          endif
       endif
       i=l
       j=l+l
       do while(j.le.k)
          if(j.lt.k)then
             if(array(j).lt.array(j+1))j=j+1
          endif
          if (t.lt.array(j))then
             array(i)=array(j)
             i=j
             j=j+j
          else
             j=k+1
          endif
       enddo
       array(i)=t
    enddo
  
    return
  end subroutine heapsort