/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author champon
 */

#include <iostream>
#include <fstream>

#include <bits/stdc++.h>
#define se cout << "test ok" << endl;
#define sp << " " <<
using namespace std;
using ll=long long;
using ld=long double;
ll mod = ll(1e9)+7;
ll inf = ll(1e18);
template<typename T1, typename T2> ll ceill(T1 a, T2 b){ return (a+b-1)/b; }
void ans(bool b, ostream& out=cout){ out << (b ? "Yes" : "No") << endl; }
void ans2(bool b, ostream& out=cout){ out << (b ? "YES" : "NO") << endl; }
template<typename T> inline bool chmax(T &a, T b){ if(a<b){a=b; return true;} return false; }
template<typename T> inline bool chmin(T &a, T b){ if(a>b){a=b; return true;} return false; }
template<typename A, size_t N, typename T> void Fill(A (&array)[N], const T &val){ fill((T*)array, (T*)(array+N), val); }
int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
int dy[] = {0, 1, 0, -1, 1, -1, -1, 1};

#ifndef INCLUDE_DEBUG_HPP
#define INCLUDE_DEBUG_HPP

#include <iostream>
#include <vector>
#include <map>
using namespace std;

namespace dbg {
    using ll = long long;

    class Debug {
    public:
        Debug(){}
        template<typename T>
        void vd(vector<T> vec);
        template<typename T>
        void vd2(vector<vector<T>> vec);
        template<typename T>
        void ad(T *arr, ll n);
        template<typename T, size_t N>
        void ad2(T (&arr)[N], ll n);
        template<typename T>
        void md(T mp);
    };

    template<typename T>
    void Debug::vd(vector<T> vec) {
        for (auto vv : vec) cout << vv << " ";
        cout << endl;
    }

    template<typename T>
    void Debug::vd2(vector<vector<T>> vec) {
        for (auto vv : vec) for (auto vvv : vv) cout << vvv << " ";
        cout << endl;
    }

    template<typename T>
    void Debug::ad(T *arr, ll n) {
        for (int i = 0; i <= n; i++) cout << arr[i] << " ";
        cout << endl;
    }

    template<typename T, size_t N>
    void Debug::ad2(T (&arr)[N], ll n) {
        for (int i = 0; i <= N; i++) for (int j = 0; j <= n; j++) cout << arr[i][j] << " ";
        cout << endl;
    }

    template<typename T>
    void Debug::md(T mp) {
        cout << "key : value" << endl;
        for (auto const &m : mp) cout << m.first << " : " << m.second << endl;
        cout << endl;
    }

}

#endif //INCLUDE_DEBUG_HPP

using dbg::Debug;
Debug debug;

class ERedAndGreenApples {
public:
	void solve(std::istream& in, std::ostream& out) {
	    ll x, y, a, b, c;
	    in >> x >> y >> a >> b >> c;
	    vector<ll> p(a), q(b), r(c);
	    for(int i=0; i<a; i++){
	        in >> p[i];
	    }
	    for(int i=0; i<b; i++){
	        in >> q[i];
	    }
	    for(int i=0; i<c; i++){
	        in >> r[i];
	    }

        sort(p.begin(), p.end());
        sort(q.begin(), q.end());
        sort(r.begin(), r.end(), greater<ll>());

        ll restx=x, resty=y;
        ll res = 0;
        for(auto& e : r){
            auto itrp = lower_bound(p.begin(), p.end(), e);
            auto itrq = lower_bound(q.begin(), q.end(), e);
            int indp = distance(p.begin(), itrp);
            int indq = distance(q.begin(), itrq);

            if(indp > a-restx && indq > b-resty){
                if(p[a-restx] > q[b-resty]){
                    resty--;
                }else{
                    restx--;
                }
                res += e;
            }else if(indp > a-restx){
                restx--;
                res += e;
            }else if(indq > b-resty){
                resty--;
                res += e;
            }
        }
        //cout << res sp restx sp resty << endl;

        for(int i=a-1; i>=a-restx; i--){
            res += p[i];
        }
        for(int i=b-1; i>=b-resty; i--){
            res += q[i];
        }

        out << res << endl;
	}
};


int main() {
	ERedAndGreenApples solver;
	std::istream& in(std::cin);
	std::ostream& out(std::cout);
	solver.solve(in, out);
	return 0;
}


Measured memory_bytes: 2560