#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <iomanip>
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <math.h>
#include <cmath>
#include <stdlib.h>
#include <stdio.h>
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
const int INF = 1001001000;
const int MOD = 1000000007;

long long gcd(long long a, long long b) {
    if (b == 0) return a;
    else return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
    return a * b / gcd(a, b);
}

using Graph = vector<vector<int>>;
//再帰とかグラフを使うときは予めNの最大値のグローバル配列を取っておく


//NのM乗を求める(繰り返し二乗法)
long long mod_pow(long long N, long long M) {
    if (M == 0) return 1;
    long long res = mod_pow((N * N) % MOD, M / 2);
    //最下位ビット(*N)が1の時は単独でNをかける
    if (M & 1) res = (res * N) % MOD;

    return res %= MOD;;
}
long long nCr(long long n, long long r) {
    long long A = 1, B = 1;
    //Aが分子Bが1/r!
    for (long long i = n - r + 1; i <= n; i++) {
        A = A * i % MOD;
    }
    for (long long i = 1; i <= r; i++) {
        B = B * i % MOD;
    }
    B = mod_pow(B, MOD - 2);
    B %= MOD;
    //Bは割るのではなく掛ける
    return (A * B) % MOD;
}

bool E[2005][2005];
vector<bool> seen;
typedef pair<int, int> P;
int D[2005];
//頂点状態を表すcolor[]において、0は未訪問、1は訪問中、2は完了を表す。
int color[101];
int find_time = 0;

int main() {
    int X, Y, A, B, C; cin >> X >> Y >> A >> B >> C;
    //vector<int> red(A), green(B), none(C);
    priority_queue<int, vector<int>, greater<int>> red,green;
    priority_queue<int> none;

    for (int i = 0; i < A; i++) { 
        int r; cin >> r;
        red.push(r);
    }
    for (int i = X; i < A; i++) red.pop();

    for (int i = 0; i < B; i++) { 
        int g; cin >> g;
        green.push(g);
    }
    for (int i = Y; i < B; i++) green.pop();

    for (int i = 0; i < C; i++) { 
        int n; cin >> n;
        none.push(n);
    }

    /*sort(red.begin(), red.end());
    sort(green.begin(), green.end());
    sort(none.begin(), none.end());*/
    bool ok = false;
    for (int i = 0; i < C; i++) {
        if (none.top() > red.top() && red.top() <= green.top()) {
            red.pop();
            red.push(none.top());
            none.pop();
            ok = true;
        }
        else if (none.top() > green.top() && green.top() <= red.top()) {
            green.pop();
            green.push(none.top());
            none.pop();
            ok = true;
        }
        if (!ok) none.pop();
    }

    long long ans = 0;
    for (int i = 0; i < X; i++) {
        ans += red.top();
        red.pop();
    }
    for (int i = 0; i < Y; i++) {
        ans += green.top();
        green.pop();
    }
    cout << ans << endl;
}


Measured memory_bytes: 1784