#include<bits/stdc++.h>
using namespace std;

typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;

#define endl '\n'
#define ff first
#define ss second
#define sz(v) (int)v.size()
#define int long long
#define pb push_back
#define f(i,l,r) for(ll i=l;i<=r;i++)
#define rf(i,r,l) for(ll i=r;i>=l;i--)
#define Max 5000001
#define inf 2147483647
#define llinf 9223372036854775807
#define all(v) v.begin(),v.end()
#define bp(n) __builtin_popcountll(n)
#define fast ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)

#define d0(a) cout<<a<<' ';
#define d1(a) cout<<a<<endl;
#define d2(a,b) cout<<a<<' '<<b<<endl;
#define d3(a,b,c) cout<<a<<' '<<b<<' '<<c<<endl;
#define d4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<endl;
#define d5(a,b,c,d,e) cout<<a<<' '<<b<<' '<<c<<' '<<d<<' '<<e<<endl;
#define d6(a,b,c,d,e,f) cout<<a<<' '<<b<<' '<<c<<' '<<d<<' '<<e<<' '<<f<<endl;

const ll N=2e3+5,mod=1e9+7,bit=61;



signed main()
{
    fast;

    ll t=1;
    //cin>>t;
    while(t--)
    {
        ll x,y,a,b,c;
        cin>>x>>y>>a>>b>>c;
        ll p[a],q[b],r[c];
        f(i,0,a-1)
        {
            cin>>p[i];
        }
        f(i,0,b-1)
        {
            cin>>q[i];
        }
        f(i,0,c-1)
        {
            cin>>r[i];
        }
        ll ans=0;
        sort(p,p+a,greater<ll>());
        sort(q,q+b,greater<ll>());
        sort(r,r+c,greater<ll>());
        vector<ll> red,green;
        f(i,0,x-1)
        {
            ans+=p[i];
            red.pb(p[i]);
        }
        f(i,0,y-1)
        {
            ans+=q[i];
            green.pb(q[i]);
        }
        ll sum=ans;
        f(i,0,c-1)
        {
            ans=max(ans,sum);
            if(sz(red)==0 and sz(green)==0)
            {
                break;
            }
            if(sz(red)!=0 and sz(green)!=0)
            {
                if(r[i]>red.back() and r[i]>green.back())
                {
                    if(red.back()<green.back())
                    {
                        sum-=red.back();
                        sum+=r[i];
                        red.pop_back();
                    }
                    else
                    {
                        sum-=green.back();
                        sum+=r[i];
                        green.pop_back();
                    }
                }
                else if(r[i]>red.back())
                {
                    sum-=red.back();
                    sum+=r[i];
                    red.pop_back();
                }
                else if(r[i]>green.back())
                {
                    sum-=green.back();
                    sum+=r[i];
                    green.pop_back();
                }
                else
                {
                    break;
                }
            }
            else if(sz(red)!=0)
            {
                if(r[i]>red.back())
                {
                    sum-=red.back();
                    sum+=r[i];
                    red.pop_back();
                }
                else
                {
                    break;
                }
            }
            else
            {
                if(r[i]>green.back())
                {
                    sum-=green.back();
                    sum+=r[i];
                    green.pop_back();
                }
                else
                {
                    break;
                }
            }
        }
        ans=max(ans,sum);
        cout<<ans<<endl;

    }
    return 0;
}


















Measured memory_bytes: 4980