#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define si size()
#define bk back()
#define popb pop_back()
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define endl "\n"
#define lb lower_bound
#define ub upper_bound
#define emp empty()
#define beg begin()
#define en end()
#define ump unordered_map
#define forl(i,a,n) for(int i=a;i<n;i++)
#define rfor(i,n,a) for(int i=n;i>=a;i--)
#define fore(i,a,n) for(int i=a;i<=n;i++)
#define len length()

//use (__int128)to extend ll range
double doINF = 1.0/0.0 ;
ostream_iterator <int> outp(cout," ");
inline ll modadd(ll n,ll m,ll mod){
    ll sum = ((n+m)%mod+mod)%mod;
    return sum;
} 
inline ll modsub(ll n,ll m, ll mod){
    ll diff = ((n-m+mod)%mod+mod)%mod;
    return diff;
}
inline ll modpro(ll n,ll m,ll mod){
    ll pro = ((n*m)%mod+mod)%mod;
    return pro;
}
inline ll pow(int x,int y){
    ll res = 1;
    while (y > 0) {
        if (y & 1)
            res = res * x;
        y = y >> 1;
        x = x * x;
    }
    return res;
}
inline ll powmod(ll x,ll y,ll mod){
    ll res = 1;
    while (y > 0) {
        if (y & 1)
            res = modpro(res , x,mod);
        y = y >> 1;
        x = modpro(x , x,mod);
    }
    return res;
}
ll min(ll a, ll b){
   if(a>b){
       return b;
   }
   return a;
}

ll max(ll a, ll b){
   if(a>b){
       return a;
   }else return b;
}
 
bool pairdec(const pair<int,int> &a,  
               const pair<int,int> &b) 
{ 		if(a.fi!=b.fi)
       	return (a.fi> b.fi);
		else return a.se>b.se;  
} 
ll power(ll x, ll y, ll mod) 
{ 
    ll res = 1; 
    x = x%mod; 
    while (y > 0) { 
        if (y & 1) 
            res = (res * x) % mod; 
  
        y = y >> 1;
        x = (x * x) % mod; 
    } 
    return res; 
} 
ll modInverse(ll a, ll mod) 
{ 
    return  powmod(a, mod - 2, mod); 
} 
ll modFact(ll n, ll mod) 
{ 
    if (n >=mod) 
        return 0; 
  
    ll result = 1; 
    for (ll i = 1; i <= n; i++) 
        result = (result * i) %mod; 
  
    return result; 
} 
//cout<<setprecision(9)<<fixed<<sum<<endl; --- precision for double numbers
//copy(v.beg,v.en,outp);
//-----comparision for pairs------
 
bool comp(const pair<int,int>pia,const pair<int,int>pib)
{
	if(pia.fi==pib.fi) return pia.se>pib.se;
	else return pia.fi>pib.fi;
}

void bfs(int x,bool visited[],vector<int>adj[],ll dist[])
{
    visited[x]=true;
    dist[x]=0;
    queue<int>q;
    q.push(x);
    while(!q.empty())
    {
        int val=q.front();
        //cout<<val<<" ";
        q.pop();
        for(auto node:adj[val])
        {
            if(!visited[node])
            {
                q.push(node);
                dist[node]=dist[val]+1;
                visited[node]=true;
            }
        }
    }
}
const ll N=1e9+7;
int main()
{
   int x,y,a,b,c;
   cin>>x>>y>>a>>b>>c;
   vector<ll>vr,vg,vc,v;
   forl(i,0,a)
   {
       ll num;
       cin>>num;
       vr.pb(num);
   }

   forl(i,0,b)
   {
       ll num;
       cin>>num;
        vg.pb(num);
   }
   
   forl(i,0,c)
   {
       ll num;
       cin>>num;
       vc.pb(num);
   }

   sort(vr.beg,vr.en,greater<int>());
   sort(vg.beg,vg.en,greater<int>());

   forl(i,0,x) v.pb(vr[i]);
   forl(i,0,y)v.pb(vg[i]);
   forl(i,0,c)v.pb(vc[i]);
   ll sum=0;
   sort(v.beg,v.en,greater<int>());
    forl(i,0,x+y)
    {
        sum+=v[i];
    }
    cout<<sum<<endl;

   


}


Measured memory_bytes: 8816