import std.stdio, std.conv, std.string, std.array, std.range, std.algorithm, std.container;
import std.math, std.random, std.bigint, std.datetime, std.format;
void main(string[] args){ if(args.length > 1) if(args[1] == "-debug") DEBUG = 1; solve(); } bool DEBUG = 0; 
void log(A ...)(lazy A a){ if(DEBUG) print(a); }
void print(){ writeln(""); } void print(T)(T t){ writeln(t); } void print(T, A ...)(T t, A a){ write(t, " "), print(a); }
string unsplit(T)(T xs){ return xs.array.to!(string[]).join(" "); }
string scan(){ static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res; }
T scan(T)(){ return scan.to!T; } T[] scan(T)(int n){ return n.iota.map!(i => scan!T()).array; }
T lowerTo(T)(ref T x, T y){ if(x > y) x = y; return x; } T raiseTo(T)(ref T x, T y){ if(x < y) x = y; return x; }

// ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- //

void solve(){
    int x = scan!int, y = scan!int, a = scan!int, b = scan!int, c = scan!int;
    long[] ps = scan!long(a);
    long[] qs = scan!long(b);
    long[] rs = scan!long(c);

    S[] us;
    foreach(p; ps) us ~= S(1, p);
    foreach(q; qs) us ~= S(2, q);
    foreach(r; rs) us ~= S(0, r);

    us.sort!"a.value>b.value"();

    int cnt1, cnt2, cntall;
    long ans;
    foreach(u; us){
        if(u.color == 0){
            ans += u.value;
            cntall += 1;
        }
        if(u.color == 1){
            if(cnt1 < x){
                ans += u.value;
                cnt1 += 1, cntall += 1;
            }
        }
        if(u.color == 2){
            if(cnt2 < x){
                ans += u.value;
                cnt2 += 1, cntall += 1;
            }
        }
        if(cntall >= x + y) break;
    }

    ans.writeln;
}

struct S{
    int color;
    long value;
}