#include <chrono>

#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <time.h>
#include <random>
#include <string>
#include <cassert>
#include <vector>
#include <ostream>
#include <istream>
#include <stack>
#include <deque>
#include <queue>
#include <functional>

using namespace std;

#define int long long
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define pii pair<int, int>
#define ld long double

ostream& operator << (ostream &a, const vector<int> &b) {
    for (auto k : b) cout << k << " ";
    return a;
}

#ifdef LOCAL
    #define dbg(x) cout << #x << " : " << (x) << "\n";
    const int INF = 1e18;
//    const int mod = 2600000069;
//    const int p = 10;
//    const ld PI = 3.1415926535;
#else
    #define dbg(x)
    const int INF = 1e18;
//    const int mod = 2600000069;
//    const int p = 179;
//    const ld PI = 3.1415926535;
#endif

//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,sse3,sse4")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("fast-math")
//#pragma GCC target("avx2")
//#pragma GCC optimize("section-anchors")
//#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
//#pragma GCC optimize("vpt")
//#pragma GCC optimize("rename-registers")
//#pragma GCC optimize("move-loop-invariants")
//#pragma GCC optimize("unswitch-loops")
//#pragma GCC optimize("function-sections")
//#pragma GCC optimize("data-sections")

int d(int i, int j) {
    return abs(i - j);
}

int sum(vector<int>& a, int l, int r) {
    if (l == 0) return a[r];
    return a[r] - a[l - 1];
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    #ifdef LOCAL
    #else
//        freopen("capitals.in", "r", stdin);
//        freopen("capitals.out", "w", stdout);
    #endif
    int x, y, n, m, k;
    cin >> x >> y >> n >> m >> k;
    vector<int> a(n), b(m), c(k);
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < m; i++) cin >> b[i];
    for (int i = 0; i < k; i++) cin >> c[i];
    sort(all(a));
    reverse(all(a));
    sort(all(b));
    reverse(all(b));
    sort(all(c));
    reverse(all(c));
    vector<int> opt(x + y + 1);
    opt[0] = 0;
    int inda = x - 1, indb = y - 1;
    for (int i = 1; i < x + y + 1; i++) {
        if (inda >= 0 && indb >= 0) {
            if (a[inda] <= b[indb]) {
                opt[i] = opt[i - 1] + a[inda];
                inda--;
            } else {
                opt[i] = opt[i - 1] + b[indb];
                indb--;
            }
        } else if (inda >= 0) {
            opt[i] = opt[i - 1] + a[inda];
            inda--;
        } else if (indb >= 0) {
            opt[i] = opt[i - 1] + b[indb];
            indb--;
        } else {
            cout << "realhype\n";
            return 1;
        }
    }
    int sum = 0;
    for (int i = 0; i < x; i++) sum += a[i];
    for (int j = 0; j < y; j++) sum += b[j];
    int cur = 0;
    int ans = sum;
    for (int i = 0; i < min(x + y, k); i++) {
        cur += c[i];
        ans = max(ans, cur + sum - opt[i + 1]);
    }
    cout << ans;
}
/*

*/


Measured memory_bytes: 3968