#include <iostream>
#include <vector>
#include <string>
#include <numeric>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <queue>
#include <deque>

using namespace std;
using ll = long long;

#define rep(C, L, R, up) for (ll C = L; C < R; C += up)
#define rev(C, R, L, down) for (ll C = R - 1; C >= L; C -= down)

ll solve1(void)
{

    int x, y, a, b, c;
    priority_queue<ll> red, none, green;
    ll ans = 0;

    cin >> x >> y >> a >> b >> c;
    rep(i, 0, a, 1)
    {
        ll p;
        cin >> p;
        red.push(p);
    }
    rep(i, 0, b, 1)
    {
        ll p;
        cin >> p;
        green.push(p);
    }
    rep(i, 0, c, 1)
    {
        ll p;
        cin >> p;
        none.push(p);
    }

    while (x != 0 && y != 0)
    {
        ll red_head, none_head, green_head;
        red_head = !red.empty() ? red.top() : 0;
        none_head = !none.empty() ? none.top() : 0;
        green_head = !green.empty() ? green.top() : 0;
        ll rn = red_head + none_head;
        ll ng = none_head + green_head;
        ll gr = green_head + red_head;

        if (rn >= ng && rn >= gr)
        {
            //cout << "rn" << endl;
            --x;
            --y;
            ans += rn;
            red.pop();
            none.pop();
        }
        else if (ng >= rn && ng >= gr)
        {
            //cout << "ng" << endl;
            --x;
            --y;
            ans += ng;
            green.pop();
            none.pop();
        }
        else
        {
            //cout << "gr" << endl;
            --x;
            --y;
            ans += gr;
            red.pop();
            green.pop();
        }
    }

    if (x != 0)
    {
        while (x != 0)
        {
            //cout << "x" << endl;
            --x;
            if (red.top() >= none.top())
            {
                ans += red.top();
                red.pop();
            }
            else
            {
                ans += none.top();
                none.pop();
            }
        }
    }

    if (y != 0)
    {
        while (y != 0)
        {
            //cout << "y" << endl;
            --y;
            if (green.top() >= none.top())
            {
                ans += green.top();
                green.pop();
            }
            else
            {
                ans += none.top();
                none.pop();
            }
        }
    }

    return ans;
}

ll solve2(void)
{

    int x, y, a, b, c;
    priority_queue<ll> red, green, apple;
    ll ans = 0;
    cin >> x >> y >> a >> b >> c;

    rep(i, 0, a, 1)
    {
        ll p;
        cin >> p;
        red.push(p);
    }

    rep(i, 0, b, 1)
    {
        ll p;
        cin >> p;
        green.push(p);
    }

    rep(i, 0, c, 1)
    {
        ll p;
        cin >> p;
        apple.push(p);
    }

    rep(i, 0, x, 1)
    {
        if (!red.empty())
        {
            apple.push(red.top());
            red.pop();
        }
        else
        {
            break;
        }
    }

    rep(i, 0, y, 1)
    {
        if (!green.empty())
        {
            apple.push(green.top());
            green.pop();
        }
        else
        {
            break;
        }
    }

    rep(i, 0, x + y, 1)
    {
        ans += apple.top();
        apple.pop();
    }

    return ans;
}

int main(void)
{
    //cout << solve1() << endl;//WA
    cout << solve2() << endl;
    return 0;
}

Measured memory_bytes: 7792