import std.stdio, std.string, std.conv, std.range;
import std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, std.random, core.bitop;

enum inf = 1_001_001_001;
enum infl = 1_001_001_001_001_001_001L;


void main() {
    int x, y, a, b, c;
    scan(x,y,a,b,c);
    auto p = readln.split.to!(long[]).sort!"a > b"()[0 .. x];
    auto q = readln.split.to!(long[]).sort!"a > b"();
    auto r = readln.split.to!(long[]).sort!"a > b"();

    long ans;

    long tmp = p.sum();
    int qf, rf;
    while (qf + rf < y) {
        if (rf == c || r[rf] < q[qf]) {
            tmp += q[qf];
            qf++;
        }
        else {
            tmp += r[rf];
            rf++;
        }
    }

    debug {
        writeln(tmp);
        writefln("qf: %s, rf: %s", qf, rf);
    }

    chmax(ans, tmp);

    foreach (k ; 0 .. x) {
        if (k >= c) {
            break;
        }

        if (k >= rf) {
            tmp -= p[$ - 1 - k];
            tmp += r[k];
            chmax(ans, tmp);
            debug {
                writeln(tmp);
                writefln("qf: %s, rf: %s", qf, rf);
            }
            continue;
        }

        tmp -= p[$ - 1 - k];
        
        if (rf == c || q[qf] > r[rf]) {
            tmp += q[qf];
            qf++;
        }
        else {
            tmp += r[rf];
            rf++;
        }

        debug {
            writeln(tmp);
            writefln("qf: %s, rf: %s", qf, rf);
        }

        chmax(ans, tmp);
    }

    writeln(ans);
}



void scan(T...)(ref T args) {
    auto line = readln.split;
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront;
    }
    assert(line.empty);
}

void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}

bool chmin(T, U...)(ref T x, U args) {
    bool isChanged;
    foreach (arg; args) if (x > arg) {
        x = arg;
        isChanged = true;
    }
    return isChanged;
}

bool chmax(T, U...)(ref T x, U args) {
    bool isChanged;
    foreach (arg; args) if (x < arg) {
        x = arg;
        isChanged = true;
    }
    return isChanged;
}

void yes(bool ok, string y = "Yes", string n = "No") {
    return writeln(ok ? y : n);
}
