#include <bits/stdc++.h>
#define range(i, l, r) for(long long int (i) = (l); (i) < (r); (i)++)
#define reversed_range(i, l, r) for (long long int (i) = (r) - 1; (i) >= l; (i)--)
using namespace std;
template <typename T>
using vec = vector<T>;
using lint = long long;
using ulint = unsigned long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;

template <typename S, typename T>
ostream& operator <<(ostream& os, pair<S, T> p) {
    os << "(";
    os << p.first << ", " << p.second;
    return os << ")";
}

template <typename T>
ostream& operator <<(ostream& os, vec<T> v) {
    os << "[";
    if (v.size() == 0) return os << "]";
    for (int i = 0; i < v.size() - 1; i++) {
        os << v.at(i) << ", ";
    }
    return os << v.at(v.size() - 1) << "]";
}

template <typename T>
ostream& operator <<(ostream& os, set<T>& s) {
    os << "{";
    if (s.begin() == s.end()) return os << "}";
    auto it_first_item = s.begin();
    os << *it_first_item;
    for (auto it = ++it_first_item; it != s.end(); it++) {
        os << ", " << *it;
    }
    return os << "}";
}

template <typename T>
ostream& operator <<(ostream& os, unordered_set<T>& s) {
    os << "{";
    if (s.begin() == s.end()) return os << "}";
    auto it_first_item = s.begin();
    os << *it_first_item;
    for (auto it = ++it_first_item; it != s.end(); it++) {
        os << ", " << *it;
    }
    return os << "}";
}

template <typename K, typename V>
ostream& operator <<(ostream& os, map<K, V> m) {
    os << "{";
    if (m.begin() == m.end()) return os << "}";
    auto it_first_item = m.begin();
    os << it_first_item->first << ": " << it_first_item->second;
    for (auto it = ++it_first_item; it != m.end(); it++) {
        os << ", " << it->first << ": " << it->second;
    }
    return os << "}";
}

template <typename K, typename V>
ostream& operator <<(ostream& os, unordered_map<K, V> m) {
    os << "{";
    if (m.begin() == m.end()) return os << "}";
    auto it_first_item = m.begin();
    os << it_first_item->first << ": " << it_first_item->second;
    for (auto it = ++it_first_item; it != m.end(); it++) {
        os << ", " << it->first << ": " << it->second;
    }
    return os << "}";
}

lint pow(lint num, lint e, lint MOD) {
    lint res = 1;
    lint cur_num = num;
    while (e) {
        if (e & 1) {
            res *= cur_num;
            res %= MOD;
        }
        cur_num *= cur_num;
        cur_num %= MOD;
        e >>= 1;
    }
    return res;
}

int main() {
    cin.tie(0); cout.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    lint X, Y, A, B, C;
    cin >> X >> Y >> A >> B >> C;
    vec<lint> red(A), green(B), trans(C);
    range(i, 0, A) cin >> red.at(i);
    range(i, 0, B) cin >> green.at(i);
    range(i, 0, C) cin >> trans.at(i);
    sort(red.begin(), red.end(), greater<lint>());
    sort(green.begin(), green.end(), greater<lint>());
    sort(trans.begin(), trans.end(), greater<lint>());
    vec<lint> chosen;
    // priority_queue<lint, vec<lint>, greater<lint>> red_chosen, green_chosen;
    lint baseline = 0;
    range(i, 0, X) {
        baseline += red.at(i);
        chosen.emplace_back(red.at(i));
    }
    range(i, 0, Y) {
        baseline += green.at(i);
        chosen.emplace_back(green.at(i));
    }
    sort(chosen.begin(), chosen.end());
    lint sum_chosen = 0, sum_trans = 0;
    lint ans = baseline;
    range(k, 0, min(X + Y, C)) {
        sum_chosen += chosen.at(k);
        sum_trans += trans.at(k);
        ans = max(ans, baseline - sum_chosen + sum_trans);
    }
    cout << ans << "\n";
    // range(i, 0, X) {
    //     ans += red.at(i);
    //     red_chosen.emplace(red.at(i));
    // }
    // range(i, 0, Y) {
    //     ans += green.at(i);
    //     green_chosen.emplace(green.at(i));
    // }
    // priority_queue<lint> trans_remaining;
    // range(i, 0, C) trans_remaining.emplace(trans.at(i));
    // while (red_chosen.top() < trans_remaining.top() or green_chosen.top() < trans_remaining.top()) {
    //     lint red_smallest = red_chosen.top(), green_smallest = green_chosen.top();
    //     lint trans_largest = trans_remaining.top();
    //     if (trans_largest - red_smallest > trans_largest - green_smallest) {
    //         red_chosen.pop();
    //         red_chosen.emplace(trans_largest);
    //         ans += trans_largest - red_smallest;
    //     } else {
    //         green_chosen.pop();
    //         green_chosen.emplace(trans_largest);
    //         ans += trans_largest - green_smallest;
    //     }
    //     trans_remaining.pop();
    // }
    // cout << ans << "\n";
}

Measured memory_bytes: 5876