#![allow(unused_imports, unused_macros, dead_code)]

macro_rules! min {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        it.next().map(|z| it.fold(z, |x, y| min!(x, y)))
    }};
    ($x:expr) => ($x);
    ($x:expr, $($ys:expr),*) => {{
        let t = min!($($ys),*);
        if $x < t { $x } else { t }
    }}
}
macro_rules! max {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        it.next().map(|z| it.fold(z, |x, y| max!(x, y)))
    }};
    ($x:expr) => ($x);
    ($x:expr, $($ys:expr),*) => {{
        let t = max!($($ys),*);
        if $x > t { $x } else { t }
    }}
}
macro_rules! ewriteln {
    ($($args:expr),*) => { let _ = writeln!(&mut std::io::stderr(), $($args),*); };
}
macro_rules! trace {
    ($x:expr) => { ewriteln!(">>> {} = {:?}", stringify!($x), $x) };
    ($($xs:expr),*) => { trace!(($($xs),*)) }
}
macro_rules! put {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        if let Some(x) = it.next() { print!("{}", x); }
        for x in it { print!(" {}", x); }
        println!("");
    }};
    ($x:expr) => { println!("{}", $x) };
    ($x:expr, $($xs:expr),*) => { print!("{} ", $x); put!($($xs),*) }
}

const M: i64 = 1_000_000_007;

fn main() {
    let mut sc = Scanner::new();
    let x: usize = sc.cin();
    let y: usize = sc.cin();
    let a: usize = sc.cin();
    let b: usize = sc.cin();
    let c: usize = sc.cin();
    let mut ps: Vec<i64> = sc.vec(a);
    let mut qs: Vec<i64> = sc.vec(b);
    let mut rs: Vec<i64> = sc.vec(c);
    ps.sort(); ps.reverse();
    qs.sort(); qs.reverse();
    rs.sort(); rs.reverse();

    let mut ans: i64 = ps[0..x].iter().sum::<i64>() + qs[0..y].iter().sum::<i64>();

    let mut vi = Some(x - 1);
    let mut vj = Some(y - 1);
    let mut vk = Some(0);

    while vk != None {
        if let (Some(i), Some(j), Some(k)) = (vi, vj, vk) {
            if rs[k] < ps[i] && rs[k] < qs[j] { break }
            if ps[i] <= qs[j] {
                ans -= ps[i]; ans += rs[k];
                vi = if i == 0 { None } else { Some(i - 1) };
                vk = if k == c - 1 { None } else { Some(k + 1) };
            } else {
                ans -= qs[j]; ans += rs[k];
                vj = if j == 0 { None } else { Some(j - 1) };
                vk = if k == c - 1 { None } else { Some(k + 1) };
            }
        }
        else if let (Some(i), Some(k)) = (vi, vk) {
            if ps[i] < rs[k] {
                ans -= ps[i]; ans += rs[k];
                vi = if i == 0 { None } else { Some(i - 1) };
                vk = if k == c - 1 { None } else { Some(k + 1) };
            } else {
                break
            }
        }
        else if let (Some(j), Some(k)) = (vj, vk) {
            if qs[j] < rs[k] {
                ans -= qs[j]; ans += rs[k];
                vj = if j == 0 { None } else { Some(j - 1) };
                vk = if k == c - 1 { None } else { Some(k + 1) };
            } else {
                break
            }
        }
        else {
            break
        }

    }

    put!(ans);
}

use std::io::{self, Write};
use std::str::FromStr;
use std::collections::VecDeque;

struct Scanner { stdin: io::Stdin, buffer: VecDeque<String>, }
impl Scanner {
    fn new() -> Self { Scanner { stdin: io::stdin(), buffer: VecDeque::new() } }
    fn cin<T: FromStr>(&mut self) -> T {
        while self.buffer.len() == 0 {
            let mut line = String::new();
            let _ = self.stdin.read_line(&mut line);
            for w in line.split_whitespace() {
                self.buffer.push_back(String::from(w));
            }
        }
        self.buffer.pop_front().unwrap().parse::<T>().ok().unwrap()
    }
    fn chars(&mut self) -> Vec<char> { self.cin::<String>().chars().collect() }
    fn vec<T: FromStr>(&mut self, n: usize) -> Vec<T> { (0..n).map(|_| self.cin()).collect() }
}


Measured memory_bytes: 13048