#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <iomanip>
#include <sstream>
#include <bitset>
#define ALL(x) (x).begin(), (x).end()
#define sz(a) int(a.size())
#define rep(i,x,n) for(int i=x;i<n;i++)
#define repd(i,x,n) for(int i=x;i<=n;i++)
#define pii pair<int,int>
#define pll pair<long long ,long long>
#define gbtb ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define MS0(X) memset((X), 0, sizeof((X)))
#define MSC0(X) memset((X), '\0', sizeof((X)))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define eps 1e-6
#define chu(x) cout<<"["<<#x<<" "<<(x)<<"]"<<endl
#define du3(a,b,c) scanf("%d %d %d",&(a),&(b),&(c))
#define du2(a,b) scanf("%d %d",&(a),&(b))
#define du1(a) scanf("%d",&(a));
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {return b ? gcd(b, a % b) : a;}
ll lcm(ll a, ll b) {return a / gcd(a, b) * b;}
ll powmod(ll a, ll b, ll MOD) { if (a == 0ll) {return 0ll;} a %= MOD; ll ans = 1; while (b) {if (b & 1) {ans = ans * a % MOD;} a = a * a % MOD; b >>= 1;} return ans;}
ll poww(ll a, ll b) { if (a == 0ll) {return 0ll;} ll ans = 1; while (b) {if (b & 1) {ans = ans * a ;} a = a * a ; b >>= 1;} return ans;}
void Pv(const vector<int> &V) {int Len = sz(V); for (int i = 0; i < Len; ++i) {printf("%d", V[i] ); if (i != Len - 1) {printf(" ");} else {printf("\n");}}}
void Pvl(const vector<ll> &V) {int Len = sz(V); for (int i = 0; i < Len; ++i) {printf("%lld", V[i] ); if (i != Len - 1) {printf(" ");} else {printf("\n");}}}
inline long long readll() {long long tmp = 0, fh = 1; char c = getchar(); while (c < '0' || c > '9') {if (c == '-') fh = -1; c = getchar();} while (c >= '0' && c <= '9') tmp = tmp * 10 + c - 48, c = getchar(); return tmp * fh;}
inline int readint() {int tmp = 0, fh = 1; char c = getchar(); while (c < '0' || c > '9') {if (c == '-') fh = -1; c = getchar();} while (c >= '0' && c <= '9') tmp = tmp * 10 + c - 48, c = getchar(); return tmp * fh;}
const int maxn = 1000010;
const int inf = 0x3f3f3f3f;
/*** TEMPLATE CODE * * STARTS HERE ***/
#define DEBUG_Switch 0
int x, y, a, b, c;
ll p[maxn];
ll q[maxn];
ll r[maxn];
pll d[maxn];
bool cmp(pll aa, pll bb)
{
    if (aa.fi != bb.fi)
    {
        return aa.fi > bb.fi;
    } else
    {
        return aa.se < bb.se;
    }
}
int main()
{
#if DEBUG_Switch
    freopen("C:\\code\\input.txt", "r", stdin);
#endif
    //freopen("C:\\code\\output.txt","r",stdin);
    x = readint();
    y = readint();
    a = readint();
    b = readint();
    c = readint();
    repd(i, 1, a)
    {
        p[i] = readll();
    }
    repd(i, 1, b)
    {
        q[i] = readll();
    }
    repd(i, 1, c)
    {
        r[i] = readll();
    }
    sort(p + 1, p + 1 + a, greater<ll>());
    sort(q + 1, q + 1 + b, greater<ll>());
    sort(r + 1, r + 1 + c, greater<ll>());
    int n = a + b + min(a + b, c);
    int id = 0;
    repd(i, 1, a)
    {
        d[++id] = mp(p[i], 1ll);
    }
    repd(i, 1, b)
    {
        d[++id] = mp(q[i], 2ll);
    }
    repd(i, 1, min(a + b, c))
    {
        d[++id] = mp(r[i], 3ll);
    }
    sort(d + 1, d + 1 + n, cmp);
    ll ans = 0ll;
    int cnt1 = 0;
    int cnt2 = 0;
    int id1 = x;
    int id2 = y;
    repd(i, 1, n)
    {
        if (d[i].se == 1 && cnt1 < x )
        {
            ans += d[i].fi;
            cnt1++;
        }
        if (d[i].se == 2 && cnt2 < y )
        {
            ans += d[i].fi;
            cnt2++;
        }
        if (d[i].se == 3 && (cnt1 < x || cnt2 < y))
        {
            ans += d[i].fi;
            if ( cnt2 < y && p[id1] > q[id2])
            {
                cnt2++;
                id2--;
            } else
            {
                cnt1++;
                id1--;
            }
        }
    }
    printf("%lld\n", ans );
    return 0;
}




Measured memory_bytes: 14592