#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yn(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YN(ans) if(ans)printf("YES\n");else printf("NO\n")
#define vector1d(type,name,...) vector<type>name(__VA_ARGS__)
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD=1000000007;
//入力系
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
//出力系
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
//デバッグ系
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll updivide(ll a,ll b){if(a%b==0) return a/b;else return (a/b)+1;}

int main(){
    INT(x,y,a,b,c);
    vector<ll> p(a),q(b),r(c),psum(a+1,0),qsum(b+1,0);
    in(p,q,r);
    sort(rall(p));
    sort(rall(q));
    sort(rall(r));
    for(int i=1;i<a+1;i++){
        psum[i]=psum[i-1]+p[i-1];
    }
    for(int i=1;i<b+1;i++){
        qsum[i]=qsum[i-1]+q[i-1];
    }
    ll sum,sump,sumq,ans=0;
    int rindex=0;
    while(1){
        sump=0,sumq=0;
        sum=psum[x]+qsum[y];
        if(rindex<c){
            if(x!=0)sump=r[rindex]+psum[x-1]+qsum[y];
            if(y!=0)sumq=r[rindex]+psum[x]+qsum[y-1];
        }
        if(sump>sum&&sump>sumq){
            ans+=r[rindex];
            rindex++;
            x--;
        }else if(sumq>sum&&sumq>sump){
            ans+=r[rindex];
            rindex++;
            y--;
        }else if(sump>sum&&sump==sumq){
            ans+=r[rindex];
            rindex++;
            if(x>y)x--;
            else if(y>x)y--;
            else x--;
        }else{
            ans+=sum;
            break;
        }
    }
    out(ans);
}

Measured memory_bytes: 7168