#include <bits/stdc++.h>
using namespace std;

// #define int long long // intで書いたけど心配なときにlong longに変換する
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);}} fast;

/* short */
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
// #define X real()
// #define Y imag()

/* REPmacro */
#define REPS(i, a, n) for (ll i = (a); i < (ll)(n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (ll i = (a); i >= (ll)(n); --i)
#define DEP(i, n) DEPS(i, n, 0)
#define EACH(i, n) for (auto&& i : n)

/* debug */
#define debug(x) cerr << x << " " << "(L:" << __LINE__ << ")" << '\n';

/* alias */
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using D = double;
using P = complex<D>;
using vs = vector<string>;
template <typename T> using PQ = priority_queue<T>;
template <typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;

/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7;
const D EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1}, dy[] = {1, 0, -1, 0, 1, -1, -1, 1};

/* func */
inline bool inside(int y, int x, int H, int W) {return y >= 0 && x >= 0 && y < H && x < W;}
inline int in() {int x; cin >> x; return x;}
inline ll IN() {ll x; cin >> x; return x;}
inline vs split(const string& t, char c) {vs v; stringstream s(t); string b; while(getline(s, b, c)) v.eb(b); return v;}
template <typename T> inline bool chmin(T& a, const T& b) {if (a > b) a = b; return a > b;}
template <typename T> inline bool chmax(T& a, const T& b) {if (a < b) a = b; return a < b;}
template <typename T, typename S> inline void print(const pair<T, S>& p) {cout << p.first << " " << p.second << endl;}
template <typename T> inline void print(const T& x) {cout << x << '\n';}
template <typename T, typename S> inline void print(const vector<pair<T, S>>& v) {for (auto&& p : v) print(p);}
template <typename T> inline void print(const vector<T>& v, string s = " ") {REP(i, v.size()) cout << v[i] << (i != (ll)v.size() - 1 ? s : "\n");}


signed main() {
    ll X, Y, A, B, C; cin >> X >> Y >> A >> B >> C;
    vector<ll> p(A);
    vector<ll> q(B);
    vector<ll> r(C);
    REP(i, A) cin >> p[i];
    REP(i, B) cin >> q[i];
    REP(i, C) cin >> r[i];
    sort(ALL(p), greater<ll>());
    // sort(ALL(q));
    sort(ALL(r), greater<ll>());
    minPQ<ll> pque;
    PQ<pair<ll, char>> qrque;
    REP(i, B) qrque.push(mp(q[i], 'g'));
    REP(i, C) qrque.push(mp(r[i], 'w'));
    // start from choosing X red apples all from originally red pool
    ll redsum = 0;
    ll greensum = 0;  // will take from qrque
    ll ans, tmpans;
    ll wusedidx = -1;
    ll pickupidx = 0;
    pair<ll, char> qrapple;
    ll ptop;
    REP(i, X) {
        pque.push(p[i]);
        redsum += p[i];
    }
    REP(i, Y) {
        qrapple = qrque.top();
        if (qrapple.Se == 'w') {
            wusedidx++;
        }
        greensum += qrapple.Fi;
        qrque.pop();
    }
    ans = redsum + greensum;
    REP(i, X) {
        if (pickupidx >= C) break;
        ptop = pque.top();
        if (r[pickupidx] < ptop) break;
        redsum -= ptop;
        redsum += r[pickupidx];
        // cout << "changed X " << ptop << " " << r[pickupidx] << " " << pickupidx << " " << wusedidx << endl;
        pque.pop();
        if (pickupidx <= wusedidx) {
            if (qrque.empty()) break;
            greensum -= r[pickupidx];
            qrapple = qrque.top();
            if (qrapple.Se == 'w') {
                wusedidx++;
            }
            greensum += qrapple.Fi;
            // cout << "changed Y " << r[pickupidx] << " " << qrapple.Fi << " " << pickupidx << " " << wusedidx << endl;
            qrque.pop();
        }
        pickupidx++;
        tmpans = redsum + greensum;
        chmax(ans, tmpans);
    }

    print(ans);

    return 0;
}

// https://github.com/kurokoji/.cpp-Template/wiki テンプレートについて
// http://www.creativ.xyz/dump-cpp-652 dump()について
// https://gist.github.com/rigibun/7905920 色々

Measured memory_bytes: 8816