import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Sparsh Sanchorawala
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        ERedAndGreenApples solver = new ERedAndGreenApples();
        solver.solve(1, in, out);
        out.close();
    }

    static class ERedAndGreenApples {
        public void solve(int testNumber, InputReader s, PrintWriter w) {
            int x = s.nextInt(), y = s.nextInt(), a = s.nextInt(), b = s.nextInt(), c = s.nextInt();
            Integer[] p = new Integer[a];
            for (int i = 0; i < a; i++)
                p[i] = s.nextInt();
            Integer[] q = new Integer[b];
            for (int i = 0; i < b; i++)
                q[i] = s.nextInt();
            Integer[] r = new Integer[c];
            for (int i = 0; i < c; i++)
                r[i] = s.nextInt();
            Arrays.sort(p);
            Arrays.sort(q);
            Arrays.sort(r);
            Integer[] f = new Integer[x + y];
            for (int i = 0; i < x; i++)
                f[i] = p[a - 1 - i];
            for (int i = 0; i < y; i++)
                f[x + i] = q[b - 1 - i];
            Arrays.sort(f);
            long[] pref = new long[x + y];
            for (int i = 0; i < x + y; i++)
                pref[i] = f[x + y - 1 - i];
            for (int i = 1; i < x + y; i++)
                pref[i] += pref[i - 1];
            long[] preg = new long[c];
            for (int i = 0; i < c; i++)
                preg[i] = r[c - 1 - i];
            for (int i = 1; i < c; i++)
                preg[i] += preg[i - 1];
            long res = pref[x + y - 1];
            for (int i = 1; i <= Math.min(c, x + y); i++) {
                long can = preg[i - 1];
                if (x + y - 1 - i >= 0)
                    can += pref[x + y - 1 - i];
                res = Math.max(can, res);
            }
            w.println(res);
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) {
                    return -1;
                }
            }
            return buf[curChar++];
        }

        public int nextInt() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }

        public static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }
}



Measured memory_bytes: 36424