#include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>

using namespace std;
#define SAY_YES cout << "YES" << endl;
#define SAY_Yes cout << "Yes" << endl;
#define SAY_NO cout << "NO" << endl;
#define SAY_No cout << "No" << endl;
#define IFYES(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "YES" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "NO" << endl;  \
    }
#define IFYes(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "Yes" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "No" << endl;  \
    }
#define IFyes(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "yes" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "no" << endl;  \
    }
#define DEBUG_OUTPUT_ARRAY(XXX, ONE)                            \
    for (int i = 0; i < (ONE); i++)                             \
    {                                                           \
        cout << "DEBUG: i = " << i << " -> " << XXX[i] << endl; \
    }
#define DEBUG_OUTPUT_ARRAY2(XXX, ONE, TWO)                             \
    for (int i = 0; i < (ONE); i++)                                    \
    {                                                                  \
        cout << "<<< i = " << i << " >>>" << endl;                     \
        for (int j = 0; j < (TWO); j++)                                \
        {                                                              \
            cout << "DEBUG: j = " << j << " -> " << XXX[i][j] << endl; \
        }                                                              \
    }
#define DEBUG_OUTPUT_ARRAY2_BOX(XXX, ONE, TWO) \
    for (int i = 0; i < (ONE); i++)            \
    {                                          \
        cout << i << "  ";                     \
        for (int j = 0; j < (TWO); j++)        \
        {                                      \
            cout << XXX[i][j] << " ";          \
        }                                      \
        cout << endl;                          \
    }

typedef pair<long long int, long long int> pll;


const long long int mod = 998244353;
const long long int INF = 1e18;


long long int X,Y,A,B,C,p[100050],q[100050],r[100050],res=0;

priority_queue<long long int,vector<long long int>,greater<long long int> >pq;
int main()
{
    cout << fixed << setprecision(18);
    cin>>X>>Y>>A>>B>>C;
    for(long long int i = 0; i < A; i++){
        cin>>p[i];
    }
    for(long long int i = 0; i < B; i++){
        cin>>q[i];
    }
    for(long long int i = 0; i < C; i++){
        cin>>r[i];
    }
    sort(p,p+A,greater<long long int>());
    sort(q,q+B,greater<long long int>());
    sort(r,r+C,greater<long long int>());
    for(long long int i = 0; i < X; i++){
        pq.push(p[i]);
        res+=p[i];
    }
    for(long long int i = 0; i < Y; i++){
        pq.push(q[i]);
        res+=q[i];
    }
    for(long long int i = 0; i < C; i++){
        if(pq.top()<=r[i]){
            res+=r[i]-pq.top();
            pq.pop();
            pq.push(r[i]);
        }
    }
    cout<<res<<endl;

}


Measured memory_bytes: 4724