#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define s second
#define f first
long long const mod = 1000000007;
#define inf 1000000000000000000
inline ll add(ll a, ll b){ return ((a%mod)+(b%mod)+mod)%mod;}
inline ll mul(ll a, ll b){ return (((a%mod)*(b%mod))%mod+mod)%mod;}
inline ll sub(ll a, ll b){ return ((a%mod)-(b%mod)+mod)%mod;}
#define level 22

ll power(ll x,ll y,ll m)
{
    if (y == 0)
        return 1;
    ll p = power(x, y/2, m) % m;
    p = (p * p) % m;
    return (y%2 == 0)? p : (x * p) % m;
}

ll modInv(ll x)
{
    return power(x,mod-2,mod)%mod;
}

ll dp[2000][2000];
void bfs(ll p,bool vis[],vector<ll>adj[])
{
    queue<ll>q;
    q.push(p);
    ll dis=0;
    while(q.empty()==0)
    {
        ll z=q.size();
        for(int i=0;i<z;i++)
        {
            ll s=q.front();
            q.pop();
            dp[p][s]=dis;
            for(auto x:adj[s])
            {
                if(vis[x]==false)
                {
                    vis[x]=true;
                    q.push(x);
                }
            }
        }
        dis++;
    }
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
  
    ll x,y,a,b,c;
    cin>>x>>y>>a>>b>>c;
    ll p[a],q[b],r[c];
    for(int i=0;i<a;i++)
        cin>>p[i];
    for(int i=0;i<b;i++)
        cin>>q[i];
    for(int i=0;i<c;i++)
        cin>>r[i];
    sort(p,p+a,greater<ll>());
    sort(q,q+b,greater<ll>());
    sort(r,r+c,greater<ll>());
    ll ans=0;
    ll it1,it2,it3=0;
    it1=it2=it3=0;
    ll red=0,green=0;
    ll total=0;
    //cout<<total<<" "<<x+y<<endl;
    while(total<x+y)
    {
        if(red==x)
        {
            if(it3<c)
            {
                if(r[it3]>q[it2])
                {
                    ans=ans+r[it3];
                    it3++;
                    total++;
                }
                else
                {
                    ans=ans+q[it2];
                    it2++;
                    green++;
                    total++;
                }
            }
            else
            {
                ll z=x+y-total;
                while(z)
                {
                    ans=ans+q[it2];
                    it2++;
                    green++;
                    total++;
                    z--;
                }
                break;
            }
            
        }
        else if(green==y)
        {
            if(it3<c)
            {
                if(r[it3]>p[it1])
                {
                    ans=ans+r[it3];
                    it3++;
                    total++;
                }
                else
                {
                    ans=ans+p[it1];
                    it1++;
                    red++;
                    total++;
                }
            }
            else
            {
                ll z=x+y-total;
                while(z)
                {
                    ans=ans+p[it1];
                    it1++;
                    red++;
                    total++;
                    z--;
                }
                break;
            }
        }
        else if(it3==c)
        {
            if(q[it2]>p[it1])
            {
                ans=ans+q[it2];
                it2++;
                green++;
                total++;
            }
            else
            {
                ans=ans+p[it1];
                it1++;
                red++;
                total++;
            }
        }
        else
        {
            if(r[it3]>=p[it1]&& r[it3]>=q[it2])
            {
                ans=ans+r[it3];
                it3++;
                total++;
            }
            else if(q[it2]>=p[it1]&& q[it2]>=r[it3])
            {
                ans=ans+q[it2];
                it2++;
                green++;
                total++;
            }
            else if(p[it1]>=q[it2]&& p[it1]>=r[it3])
            {
                ans=ans+p[it1];
                it1++;
                red++;
                total++;
            }
        }
        //cout<<ans<<" "<<total<<" "<<it1<<" "<<it2<<" "<<it3<<endl;
        /*if(it3==c)
        {
            while(red<x)
            {
                ans=ans+p[it1];
                it1++;
                red++;
                total++;
            }
            cout<<ans<<" "<<total<<" "<<it1<<" "<<it2<<" "<<it3<<endl;
            while(green<y)
            {
                ans=ans+q[it2];
                it2++;
                green++;
                total++;
            }
            cout<<ans<<" "<<total<<" "<<it1<<" "<<it2<<" "<<it3<<endl;
            break;
        }*/
    }
    cout<<ans<<endl;
    
    return 0;
}


Measured memory_bytes: 2560