//#include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18) + 1;
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v)          \
    cout << #v << ":";    \
    for (auto x : v)      \
    {                     \
        cout << x << ' '; \
    }                     \
    cout << endl;
template <class T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
    if (b < a)
    {
        a = b;
        return 1;
    }
    return 0;
}
//cout<<fixed<<setprecision(15);有効数字15桁
//-std=c++14
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 x,y,A,B,C;
priority_queue<ll> a,b,c;

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> x>>y>>A>>B>>C;
    for (int i = 0; i < A; i++)
    {
        ll temp;
        cin >> temp;
        a.push(temp);
    }
    for (int i = 0; i < B; i++)
    {
        ll temp;
        cin >> temp;
        b.push(temp);
    }
    for (int i = 0; i < C; i++)
    {
        ll temp;
        cin >> temp;
        c.push(temp);
    }
    int xcount=0;
    int ycount=0;
    ll ans=0;
    rep(i,x+y){
        if(xcount==x){
            if(c.empty()){
                ans+=b.top();
                b.pop();
                ycount++;
            }
            else{
                if(b.top()>=c.top()){
                    ans+=b.top();
                    b.pop();
                    ycount++;
                }
                else{
                    ans+=c.top();
                    c.pop();
                }
            }
        }
        else if(ycount==y){
            if(c.empty()){
                ans+=a.top();
                a.pop();
                xcount++;
            }
            else{
                if(a.top()>=c.top()){
                    ans+=a.top();
                    a.pop();
                    xcount++;
                }
                else{
                    ans+=c.top();
                    c.pop();
                }
            }
        }
        else{
            if(c.empty()){
                if(a.top()>=b.top()){
                    ans+=a.top();
                    a.pop();
                    xcount++;
                }
                else{
                    ans+=b.top();
                    b.pop();
                }
            }
            else{
                if(a.top()>=b.top()&&a.top()>=c.top()){
                    ans+=a.top();
                    a.pop();
                    xcount++;
                }
                else if(b.top()>=a.top()&&b.top()>=c.top()){
                    ans+=b.top();
                    b.pop();
                    ycount++;
                }
                else{
                    ans+=c.top();
                    c.pop();
                }
            }
        }
    }
    cout<<ans<<"\n";
}


Measured memory_bytes: 3316