{-# OPTIONS_GHC -O2 #-}
{-# LANGUAGE BangPatterns, CPP, FlexibleContexts, FlexibleInstances         #-}
{-# LANGUAGE KindSignatures, LambdaCase, MagicHash, MultiParamTypeClasses   #-}
{-# LANGUAGE MultiWayIf, OverloadedStrings, RecordWildCards                 #-}
{-# LANGUAGE ScopedTypeVariables, TupleSections, TypeFamilies, ViewPatterns #-}

import           Control.Applicative
import           Control.Exception
import           Control.Monad
import           Control.Monad.Primitive
import           Control.Monad.ST
import           Control.Monad.State.Strict
import           Data.Bool
import qualified Data.ByteString             as B
import qualified Data.ByteString.Builder     as B
import qualified Data.ByteString.Char8       as C
import qualified Data.ByteString.Internal    as B
import qualified Data.ByteString.Unsafe      as B
import           Data.Char
import qualified Data.Foldable               as F
import           Data.Function
import           Data.Functor.Identity
import qualified Data.IntMap.Strict          as IM
import qualified Data.IntSet                 as IS
import qualified Data.List                   as L
import qualified Data.Map.Strict             as M
import           Data.Monoid
import           Data.Ord
import           Data.Primitive.MutVar
import           Data.Ratio
import qualified Data.Set                    as S
import           Data.Tuple
import qualified Data.Vector                 as V
import qualified Data.Vector.Generic         as G
import qualified Data.Vector.Generic.Mutable as GM
import qualified Data.Vector.Mutable         as VM
import qualified Data.Vector.Unboxed         as U
import qualified Data.Vector.Unboxed.Mutable as UM
import           Debug.Trace
import           Foreign                     hiding (void)
import           GHC.Exts
import qualified System.IO                   as IO
import           Unsafe.Coerce

main :: IO ()
main = do
    [x, y, a, b, c] <- map read.words <$> getLine :: IO [Int]
    ps <- U.unfoldrN a (runParser int) <$> C.getLine
    qs <- U.unfoldrN b (runParser int) <$> C.getLine
    rs <- U.unfoldrN c (runParser int) <$> C.getLine
    print $ solve x y ps qs rs

solve :: Int -> Int -> U.Vector Int -> U.Vector Int -> U.Vector Int -> Int
solve x y ps qs rs = runST $ do
    mbuf <- UM.unsafeNew (x + y + U.length rs)
    U.unsafeCopy (UM.unsafeSlice 0 x mbuf) . U.drop (U.length ps - x) $ radixSortInt ps
    U.unsafeCopy (UM.unsafeSlice x y mbuf) . U.drop (U.length qs - y) $ radixSortInt qs
    U.unsafeCopy (UM.unsafeSlice (x + y) (U.length rs) mbuf) rs
    U.sum . U.drop (U.length rs) . radixSortInt <$> U.unsafeFreeze mbuf

-------------------------------------------------------------------------------
-- Utils
-------------------------------------------------------------------------------
rep :: Monad m => Int -> (Int -> m ()) -> m ()
rep !n = U.forM_ $ U.generate n id
{-# INLINE rep #-}
rev :: Monad m => Int -> (Int -> m ()) -> m ()
rev !n = U.forM_ $ U.iterateN n (subtract 1) (n - 1)
{-# INLINE rev #-}
infixl 8 `shiftRL`, `unsafeShiftRL`
shiftRL = unsafeShiftRL
{-# INLINE shiftRL #-}
unsafeShiftRL (I# x#) (I# i#) = I# (uncheckedIShiftRL# x# i#)
{-# INLINE unsafeShiftRL #-}
type Parser a = StateT C.ByteString Maybe a
runParser :: Parser a -> C.ByteString -> Maybe (a, C.ByteString)
runParser = runStateT
{-# INLINE runParser #-}
int :: Parser Int
int = coerce $ C.readInt . C.dropWhile isSpace
{-# INLINE int #-}
int1 :: Parser Int
int1 = fmap (subtract 1) int
{-# INLINE int1 #-}
char :: Parser Char
char = coerce C.uncons
{-# INLINE char #-}
byte :: Parser Word8
byte = coerce B.uncons
{-# INLINE byte #-}
-------------------------------------------------------------------------------
-- Data.Vector.Sort.Radix
-------------------------------------------------------------------------------
radixSortInt :: U.Vector Int -> U.Vector Int
radixSortInt = unsafeCoerce . radixSort64 . unsafeCoerce
radixSort32 :: U.Vector Word32 -> U.Vector Word32
radixSort32 v = F.foldl' step v [0, 16] where { mask k x = fromIntegral $ unsafeShiftR x k .&. 65535; step v k = U.create $ do { pref <- U.unsafeThaw . U.prescanl' (+) 0 . U.unsafeAccumulate (+) (U.replicate 65536 0) $ U.map (flip (,) 1 . mask k) v; res <- UM.unsafeNew $ U.length v; U.forM_ v $ \ x -> do { let { !masked = mask k x}; i <- UM.unsafeRead pref masked; UM.unsafeWrite pref masked $ i + 1; UM.unsafeWrite res i x}; return res}}
{-# INLINE radixSort32 #-}
radixSort64 :: U.Vector Word64 -> U.Vector Word64
radixSort64 v = F.foldl' step v [0, 16, 32, 48] where { mask k x = fromIntegral $ unsafeShiftR x k .&. 65535; step v k = U.create $ do { pref <- U.unsafeThaw . U.prescanl' (+) 0 . U.unsafeAccumulate (+) (U.replicate 65536 0) $ U.map (flip (,) 1 . mask k) v; res <- UM.unsafeNew $ U.length v; U.forM_ v $ \ x -> do { let { !masked = mask k x}; i <- UM.unsafeRead pref masked; UM.unsafeWrite pref masked $ i + 1; UM.unsafeWrite res i x}; return res}}
{-# INLINE radixSort64 #-}


Measured memory_bytes: 21500