import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;

///
struct PriorityQueue(alias _fun, T) {
    import std.functional : binaryFun;
    import std.algorithm : swap;
    alias fun = binaryFun!_fun;

    ///
    this(T[] ts) {
        foreach (t; ts) enqueue(t);
    }

    ///
    PriorityQueue!(_fun, T) enqueue(T e) {
        if (this.tree.length == 0) this.tree.length = 1;
        if (this.tree.length == this.n) this.tree.length *= 2;
        this.tree[this.n] = e;
        auto i = this.n;
        this.n += 1;
        while (i) {
            auto j = (i-1)/2;
            if (fun(this.tree[i], this.tree[j])) {
                swap(this.tree[i], this.tree[j]);
                i = j;
            } else break;
        }
        return this;
    }

    alias insertFront = enqueue;
    alias insert = enqueue;

    ///
    T dequeue() {
        auto ret = this.tree[0];
        this.n -= 1;
        this.tree[0] = this.tree[this.n];
        this.tree = this.tree[0..$-1];
        size_t i;
        for (;;) {
            auto l = i*2+1;
            auto r = i*2+2;
            if (l >= this.n) break;
            size_t j;
            if (r >= this.n) {
                j = l;
            } else {
                j = fun(this.tree[r], this.tree[l]) ? r : l;
            }
            if (fun(this.tree[j], this.tree[i])) {
                swap(this.tree[i], this.tree[j]);
                i = j;
            } else break;
        }
        return ret;
    }

    ///
    @property
    T front() {
        return this.tree[0];
    }

    ///
    @property
    bool empty() {
        return this.n == 0;
    }

    ///
    void popFront() {
        this.dequeue();
    }

    alias removeFront = popFront;

    ///
    @property
    size_t length() {
        return this.n;
    }

private:
    size_t n;
    T[] tree;
}

///
PriorityQueue!(fun, T) priority_queue(alias fun, T)(T[] ts = []) {
    return PriorityQueue!(fun, T)(ts);
}

void main()
{
    auto xyabc = readln.split.to!(int[]);
    auto X = xyabc[0];
    auto Y = xyabc[1];
    auto A = xyabc[2];
    auto B = xyabc[3];
    auto C = xyabc[4];
    auto ps = priority_queue!("a > b", long)(readln.split.to!(long[]));
    auto qs = priority_queue!("a > b", long)(readln.split.to!(long[]));
    auto rs = priority_queue!("a > b", long)(readln.split.to!(long[]));

    long res;
    while (X != 0 || Y != 0) {
        auto p = ps.empty ? -1 : ps.front;
        auto q = qs.empty ? -1 : qs.front;
        auto r = rs.empty ? -1 : rs.front;
        if (p >= q && p >= r) {
            if (X > 0) {
                --X;
                res += ps.dequeue();
            } else {
                --Y;
                if (q > r) {
                    res += qs.dequeue();
                } else {
                    res += rs.dequeue();
                }
            }
        } else
        if (q >= p && q >= r) {
            if (Y > 0) {
                --Y;
                res += qs.dequeue();
            } else {
                --X;
                if (p > r) {
                    res += ps.dequeue();
                } else {
                    res += rs.dequeue();
                }
            }
        } else {
            res += rs.dequeue();
            if (X == 0) {
                --Y;
            } else if (Y == 0) {
                --X;
            } else if (p > q) {
                --Y;
            } else {
                --X;
            }
        }
    }
    writeln(res);
}