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

// macros
#define int long long 
#define TIME clock() * 1.0 / CLOCKS_PER_SEC
#define all(c) c.begin(), c.end()
#define PB push_back
#define MP make_pair
#define bitcount __builtin_popcount
#define watch(x) cerr<< (#x) << " is " << (x) <<"\n";
#define sz(x) ((int)((x).size()))
#define UNIQUE(c) (c).resize(unique(all(c)) - (c).begin())
#define pii2ll(p) ((ll)(p).first<<32 | (p).second)

// type definitions
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector< vi > vvi;
typedef pair<int, int> pii;
typedef long double ld;

// template functions
template < typename A, typename B >
ostream &operator << ( ostream& os, const pair< A, B > & p ) {
    return os << "(" << p.first << ", " << p.second << ")";
}
template < typename T >
ostream &operator << ( ostream & os, const vector< T > &v ) {
    os << "[";
    typename vector< T > :: const_iterator it;
    for( it = v.begin(); it != v.end(); it++ ) {
        if( it != v.begin() ) os << ", ";
        os << *it;
    }
    return os << "]";
}
template < typename T >
ostream &operator << ( ostream & os, const set< T > &v ) {
    os << "{";
    typename set< T > :: const_iterator it;
    for ( it = v.begin(); it != v.end(); it++ ) {
        if( it != v.begin() ) os << ", ";
        os << *it;
    }
    return os << "}";
}
template < typename A, typename B >
ostream &operator << ( ostream & os, const map< A, B > &v ) {
    os << "[";
    typename map< A, B >::const_iterator it;
    for( it = v.begin(); it != v.end(); it++ ) {
        if( it != v.begin() ) os << ", ";
        os << it -> first << " -> " << it -> second ;
    }
    return os << "]";
}
template<typename T>
T gcd(T a, T b) { if(a==0 or b==0) return a+b; return gcd(b, a%b) ; }
template<typename T>
T lcm(T a, T b) { if(a==0 or b==0) return 0; return a/gcd(a, b)*b; }

// random number generation
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

// constants
const long double eps = LDBL_EPSILON;
const int inf = 1e15;
const int modn = 1e9+7;
const int maxn = 2e5+3;

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    // Your code here
    int x, y, a, b, c;
    cin>>x>>y>>a>>b>>c;

    vi red(a), green(b), nocol(c);
    for(int i=0; i<a; i++) {
        cin>>red[i];
        // q.push(MP(red[i], -1));
    }
    for(int i=0; i<b; i++) {
        cin>>green[i];
        // q.push(MP(green[i], -2));
    }
    for(int i=0; i<c; i++) {
        cin>>nocol[i];
        // q.push(MP(nocol[i], i));
    }
    sort(all(red));
    sort(all(green));
    sort(all(nocol));
    reverse(all(red));
    reverse(all(green));
    reverse(all(nocol));
    vi tmp;
    for(int i=0; i<x; i++) {
        tmp.PB(red[i]);
    }
    for(int i=0; i<y; i++) {
        tmp.PB(green[i]);
    }
    for(int i=0; i<c; i++) {
        tmp.PB(nocol[i]);
    }
    sort(all(tmp));
    reverse(all(tmp));
    int ans = 0;
    for(int i=0; i<x+y; i++) {
        ans += tmp[i];
    }
    cout << ans << "\n";
    // int curr = 0, curg = 0;
    // int ans = 0;
    // while(curr<x or curg < y) {
    //     auto p = q.top();
    //     q.pop();
    //     int val = p.first, type = p.second;
    //     if(type==-1) {
    //         if(curr < x) {
    //             curr++;
    //             ans += val;
    //         }
    //     }
    //     else if(type==-2) {
    //         if(curg < y) {
    //             curg++;
    //             ans += val;
    //         }
    //     }
    //     else {
    //         if(!marked[])
    //     }
    // }
    return 0;
}



Measured memory_bytes: 8944