/* Generated by powerful Codeforces Tool
 * You can download the binary file in here https://github.com/xalanq/cf-tool (win, osx, linux)
 * Author: step_by_step
 * Time: 2020-03-19 17:35:03
**/

//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
  
#include <iostream>
#include <stdlib.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <assert.h>
#include <memory.h>
#include <time.h>
#include <bitset>

#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define ld long double
#define rep(i, l, r) for (int i = (l); i < (r); i++)
#define repb(i, r, l) for (int i = (r); i > (l); i--)
#define sz(a) (int)a.size()
#define fi first
#define se second
#define mp(a, b) make_pair(a, b)
#define rank qwertyuio
#define next dfghjk
#define prev fhsgfhjf
#define plus fsghsf
#define minus ytryr
  
using namespace std;
  
inline bool setmin(int &x, int y) { return (y < x) ? x = y, 1 : 0; }
inline bool setmax(int &x, int y) { return (y > x) ? x = y, 1 : 0; }
inline bool setmin(ll &x, ll y) { return (y < x) ? x = y, 1 : 0; }
inline bool setmax(ll &x, ll y) { return (y > x) ? x = y, 1 : 0; }
  
const int N = 100000;
const int inf = (int)1e9 + 1;
const ll big = (ll)1e18 + 1;
const int P = 239;
const int P1 = 31;
const int P2 = 57;
const int MOD = (int)1e9 + 7;
const int MOD1 = (int)1e9 + 9;
const int MOD2 = 998244353;
const ld eps = 1e-9;
const double pi = atan2(0, -1);
const int ABC = 26;

int main()
{
    //freopen("circus.in", "r", stdin);
    //freopen("circus.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.precision(20);
    cout << fixed;
    //ll TL = 10.95 * CLOCKS_PER_SEC;
    //clock_t time = clock();
    int x, y, a, b, c;
    cin >> x >> y >> a >> b >> c;
    int A[a], B[b], C[c];
    rep(i, 0, a) {
        cin >> A[i];
    }
    rep(i, 0, b) {
        cin >> B[i];
    }
    rep(i, 0, c) {
        cin >> C[i];
    }
    sort(A, A + a, [](int x, int y) { return x > y; });
    sort(B, B + b, [](int x, int y) { return x > y; });
    sort(C, C + c, [](int x, int y) { return x > y; });

    ll ans = 0;
    ll curA = 0;
    ll curB = 0;
    multiset<int> m;

    rep(i, 0, min(x, c)) {
        curA += C[i];
    }
    rep(i, min(x, c), c) {
        m.insert(C[i]);
    }

    rep(i, 0, b) {
        m.insert(B[i]);
    }

    while (sz(m) > y) {
        m.erase(m.begin());
    }

    for (int i : m) {
        curB += i;
    }

    rep(cntA, 0, x + 1) {

        /*cout << cntA << endl;
        cout << curA << " " << curB << endl;
        for (int i : m) {
            cout << i << " ";
        }
        cout << endl;
        cout << endl;*/

        if ((x - cntA) <= c) {
            setmax(ans, curA + curB);
        }
        if (cntA < x) {
            curA += A[cntA];
            if (x - 1 - cntA < c) {
                int id = x - 1 - cntA;
                curA -= C[id];
                m.insert(C[id]);
                curB += C[id];
                while (sz(m) > y) {
                    curB -= *m.begin();
                    m.erase(m.begin());
                }
            }
        }
    }

    cout << ans << "\n";
    return 0;
}



Measured memory_bytes: 10752