#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
#define Pool(i, m, n) for (ll i = n; i >= m; i--)
#define mod 1000000007ll
#define setbit bitset<8>
#define flagcount __builtin_popcount
#define flag(x) (1 << x)
#define flagadd(bit, x) bit |= flag(x)
#define flagpop(bit, x) bit &= ~flag(x)
#define flagon(bit, i) bit &flag(i)
#define flagoff(bit, i) !(bit & (1 << i))
#define all(v) v.begin(), v.end()
#define low2way(v, x) lower_bound(all(v), x)
#define high2way(v, x) upper_bound(all(v), x)
#define count2way(v, x) high2way(v, x) - low2way(v, x)
#define lower(v, x) low2way(v, x) - v.begin()       //1番左が0、もし見つから無いならｎを出力
#define higher(v, x) high2way(v, x) - v.begin() - 1 //1番左が0、もし見つからないならn-1を出力（注意）
#define putout(a) cout << a << endl
#define putout2(a, b) \
    putout(a);        \
    putout(b)
#define putout3(a, b, c) \
    putout(a);           \
    putout(b);           \
    putout(c)
#define putout4(a, b, c, d) \
    putout(a);              \
    putout(b);              \
    putout(c);              \
    putout(d)
#define putout5(a, b, c, d, e) \
    putout(a);                 \
    putout(b);                 \
    putout(c);                 \
    putout(d);                 \
    putout(e)
#define Gput(a, b) G[a].push_back(b)
#define cin1(a) cin >> a
#define cin2(a, b) cin >> a >> b
#define cin3(a, b, c) cin >> a >> b >> c
#define cin4(a, b, c, d) cin >> a >> b >> c >> d
#define cin5(a, b, c, d, e) cin >> a >> b >> c >> d >> e
#define sum(v) accumulate(all(v), 0ll)
#define gcd(x, y) __gcd(x, y)
ll ctoi(char c)
{
    if (c >= '0' && c <= '9')
    {
        return c - '0';
    }
    return 0;
}
template <typename T>
T lcm(T x, T y)
{
    T z = gcd(x, y);
    return x * y / z;
}
template <typename T>
bool primejudge(T n)
{
    if (n < 2)
        return false;
    else if (n == 2)
        return true;
    else if (n % 2 == 0)
        return false;
    double sqrtn = sqrt(n);
    for (T i = 3; i < sqrtn + 1; i++)
    {
        if (n % i == 0)
        {
            return false;
        }
        i++;
    }
    return true;
}
template <typename T>
T modinv(T a, T m)
{
    T b = m, u = 1, v = 0;
    while (b)
    {
        T t = a / b;
        a -= t * b;
        swap(a, b);
        u -= t * v;
        swap(u, v);
    }
    u %= m;
    if (u < 0)
        u += m;
    return u;
}
//場合によって使い分ける
//const ll dx[4]={1,0,-1,0};
//const ll dy[4]={0,1,0,-1};
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
//多次元配列の宣言法
//vector<vector<ll>> field(h, vector<ll>(w));
template <class T>
inline void chmax(T &a, T b)
{
    if (a < b)
        a = b;
}
template <class T>
inline void chmin(T &a, T b)
{
    if (a > b)
        a = b;
}
/*
ライブラリをここに置いてコメントを削除
*/
long long modpow(long long a, long long n)
{
    long long res = 1;
    while (n > 0)
    {
        if (n & 1)
            res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}
long long modinv(long long a)
{
    return modpow(a, mod - 2);
}
vec fact(3000001);    //fact[i]=(i!)
vec factinv(3000001); //factinv[i]=(i!)^-1
void COMinit()
{
    long long now = 1;
    fact[0] = 1;
    factinv[0] = modinv(0);
    Loop(i, 1, 3000001)
    {
        now *= i;
        now %= mod;
        fact[i] = now;
        factinv[i] = modinv(now);
    }
}
long long COM(long long n, long long r)
{
    if (n < r)
        return 0;
    if (n < 0 || r < 0)
        return 0;
    if (n == r)
        return 1;
    if (r == 0)
        return 1;
    long long ans = fact[n];
    ans *= factinv[r];
    ans %= mod;
    ans *= factinv[n - r];
    ans %= mod;
    return ans;
}
//数を受け取って各桁の和を返す関数
ll dightsum(ll n)
{
    string s = to_string(n);
    ll x = s.size();
    ll ans = 0;
    loop(i, x) ans += ctoi(s[i]);
    return ans;
}
Graph G;
//始点sからS回以内の移動でたどりつける町を探索
void bfs(vec &dist, ll s)
{
    queue<ll> que;
    dist[s] = 0;
    que.push(s);
    while (!que.empty())
    {
        ll v = que.front();
        que.pop();
        for (auto next_v : G[v])
        {
            if (dist[next_v] != -1)
                continue;
            dist[next_v] = dist[v] + 1;
            que.push(next_v);
        }
    }
}
int main()
{
    cout << fixed << setprecision(30);
    ll x, y, a, b, c;
    cin >> x >> y >> a >> b >> c;
    vec p(a), q(b), r(c);
    loop(i, a) cin >> p[i];
    loop(i, b) cin >> q[i];
    loop(i, c) cin >> r[i];
    sort(all(p));
    sort(all(q));
    sort(all(r));
    reverse(all(p));
    reverse(all(q));
    reverse(all(r));
    //しゃくとり法
    ll ans = 0;
    loop(i, x) ans += p[i];
    loop(i, y) ans += q[i];
    ll pnow = x - 1, qnow = y - 1, rnow = 0;
    /*ひたすらp[pnow]とq[qnow]を比較していき、
    例えばp[pnow]が小さければr[rnow]と比較し、
    r[rnow]より小さければpnow--,rnow++して継続(ここでpnow==-1||qnow==-1||rnow==cなら終了)
    大きければ終了
    */
    while (pnow >= 0 && qnow >= 0 && rnow <= c)
    {
        if (p[pnow] <= q[qnow])
        {
            if (p[pnow] < r[rnow])
            {
                ans -= p[pnow];
                ans += r[rnow];
                pnow--;
                rnow++;
                continue;
            }
            else
            {
                break;
            }
        }
        else
        {
            if (q[qnow] < r[rnow])
            {
                ans -= q[qnow];
                ans += r[rnow];
                qnow--;
                rnow++;
                continue;
            }
            else
            {
                break;
            }
        }
    }
    if (qnow == -1)
    {
        while (pnow >= 0 && rnow <= c)
        {
            if (p[pnow] < r[rnow])
            {
                ans -= p[pnow];
                ans += r[rnow];
                pnow--;
                rnow++;
                continue;
            }
            else
            {
                break;
            }
        }
    }
    if (pnow == -1)
    {
        while (qnow >= 0 && rnow <= c)
        {
            if (q[qnow] < r[rnow])
            {
                ans -= q[qnow];
                ans += r[rnow];
                qnow--;
                rnow++;
                continue;
            }
            else
            {
                break;
            }
        }
    }
    putout(ans);
    return 0;
}

Measured memory_bytes: 49536