#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <limits>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <functional>
#include <iomanip>

using namespace std;

#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
using ll = long long;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vvvll = std::vector<vvll>;
#define reps(i, S, E) for (ll i = (S); i <= (E); i++)
#define rep(i, N) reps(i, 0, N-1)
#define deps(i, E, S) for (ll i = (E); i >= (S); i--)
#define dep(i, N) deps(i, N-1, 0)
const ll INF = 1LL << 60;
const int INF_INT = 1 << 30;

template<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; }return false; }
template<class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; }return false; }
struct mll {
	static ll MOD;
	ll val;
	mll(ll v = 0) : val(v % MOD) { if (val < 0) val += MOD; }
	mll operator - () const { return -val; }
	mll operator + (const mll &b) const { return val + b.val; }
	mll operator - (const mll &b) const { return val - b.val; }
	mll operator * (const mll &b) const { return val * b.val; }
	mll operator / (const mll &b) const { return mll(*this) /= b; }
	mll operator + (ll b) const { return *this + mll(b); }
	mll operator - (ll b) const { return *this - mll(b); }
	mll operator * (ll b) const { return *this * mll(b); }
	friend mll operator + (ll a, const mll &b) { return b + a; }
	friend mll operator - (ll a, const mll &b) { return -b + a; }
	friend mll operator * (ll a, const mll &b) { return b * a; }
	mll &operator += (const mll &b) { val = (val + b.val) % MOD; return *this; }
	mll &operator -= (const mll &b) { val = (val + MOD - b.val) % MOD; return *this; }
	mll &operator *= (const mll &b) { val = (val*b.val) % MOD; return *this; }
	mll &operator /= (const mll &b) {
		ll c = b.val, d = MOD, u = 1, v = 0;
		while (d) {
			ll t = c / d;
			c -= t * d; swap(c, d);
			u -= t * v; swap(u, v);
		}
		val = val * u % MOD;
		if (val < 0) val += MOD;
		return *this;
	}
	mll &operator += (ll b) { return *this += mll(b); }
	mll &operator -= (ll b) { return *this -= mll(b); }
	mll &operator *= (ll b) { return *this *= mll(b); }
	mll &operator /= (ll b) { return *this /= mll(b); }
	bool operator == (const mll &b) { return val == b.val; }
	bool operator != (const mll &b) { return val != b.val; }
	bool operator == (ll b) { return *this == mll(b); }
	bool operator != (ll b) { return *this != mll(b); }
	friend bool operator == (ll a, const mll &b) { return mll(a) == b.val; }
	friend bool operator != (ll a, const mll &b) { return mll(a) != b.val; }
	friend ostream &operator << (ostream &os, const mll &a) { return os << a.val; }
	friend istream &operator >> (istream &is, mll &a) { return is >> a.val; }
	static mll Combination(ll a, ll b) {
		chmin(b, a - b);
		if (b < 0) return mll(0);
		mll c = 1;
		rep(i, b) c *= a - i;
		rep(i, b) c /= i + 1;
		return c;
	}
};
using vmll = std::vector<mll>;
using vvmll = std::vector<vmll>;
using vvvmll = std::vector<vvmll>;
using vvvvmll = std::vector<vvvmll>;

struct Fast {
	Fast() {
		cin.tie(0);
		ios::sync_with_stdio(false);
		cout << fixed << setprecision(std::numeric_limits<double>::max_digits10);
	}
} fast; //cin,cout高速化のおまじない＋桁数指定

ll mll::MOD = (ll)(1e9 + 7);// 998244353ll;



struct LLPair {
	ll a = 0;
	ll b = 0;
	LLPair() {}
	LLPair(ll a, ll b) {
		this->a = a;
		this->b = b;
	}
};



//
//// index が条件を満たすかどうか
//bool isOK(ll Z) {
//	ll cX = 0;
//	ll cY = 0;
//	ll cN = 0;
//	ll last = Z;
//	vll none(0);
//	rep(i, D) {
//		if (S[i].a == 0) {
//			if (cX < X) {
//				cX++;
//				last -= S[i].b;
//			}
//		}
//		else if (S[i].a == 1) {
//			if (cY < Y) {
//				cY++;
//				last -= S[i].b;
//			}
//		}
//		else {
//			cN++;
//			last -= S[i].b;
//		}
//	}
//}
//
//// 汎用的な二分探索のテンプレ
//ll binary_search() {
//	ll ok = -1; //「index = 0」が条件を満たすこともあるので、初期値は -1
//	ll ng = 1000000000000000; // 「index = a.size()-1」が条件を満たさないこともあるので、初期値は a.size()
//
//	// ok と ng のどちらが大きいかわからないことを考慮
//	while (abs(ok - ng) > 1) {
//		ll mid = (ok + ng) / 2;
//		if (isOK(mid)) {
//			ok = mid;
//		}
//		else {
//			ng = mid;
//		}
//	}
//	return ok;
//}

int main() {
	ll X;
	ll Y;
	ll A;
	ll B;
	ll C;
	ll D;

	cin >> X;
	cin >> Y;
	cin >> A;
	cin >> B;
	cin >> C;

	vector<ll> P(0);
	vector<ll> Q(0);
	vector<ll> R(0);
	//vector<LLPair> S(0);

	P.resize(A, 0);
	Q.resize(B, 0);
	R.resize(C, 0);

	D = A + B + C;

	rep(i, A) {
		cin >> P[i];
		//S.push_back(LLPair(0, P[i]));
	}
	rep(i, B) {
		cin >> Q[i];
		//S.push_back(LLPair(1, Q[i]));
	}
	rep(i, C) {
		cin >> R[i];
		//S.push_back(LLPair(2, R[i]));
	}


	std::sort(P.begin(), P.end(), std::greater<ll>());
	std::sort(Q.begin(), Q.end(), std::greater<ll>());
	std::sort(R.begin(), R.end(), std::greater<ll>());

	//std::sort(R.begin(), R.end(), [](const LLPair &a, const LLPair &b) {
	//	return a.b> b.b; //降順にするには > とする
	//});

	ll sum = 0;
	rep(i, X) {
		sum += P[i];
	}
	rep(i, Y) {
		sum += Q[i];
	}
	ll iR = 0;
	ll iP = X - 1;
	ll iQ = Y - 1;
	while (true) {
		if (iP >= 0 && iQ >= 0){
			if (P[iP] < Q[iQ]) {
				//Pの交換
				if (P[iP] < R[iR]) {
					sum += R[iR];
					sum -= P[iP];
					iP--;
					iR++;
				}
				else {
					break;
				}
			}
			else {
				//Qの交換
				if (Q[iQ] < R[iR]) {
					sum += R[iR];
					sum -= Q[iQ];
					iQ--;
					iR++;
				}
				else {
					break;
				}
			}
		}
		else if(iP >= 0) {
			//Pの交換
			if (P[iP] < R[iR]) {
				sum += R[iR];
				sum -= P[iP];
				iP--;
				iR++;
			}
			else {
				break;
			}
		}
		else if (iQ >= 0) {
			//Qの交換
			if (Q[iQ] < R[iR]) {
				sum += R[iR];
				sum -= Q[iQ];
				iQ--;
				iR++;
			}
			else {
				break;
			}
		}
		else {
			break;
		}

		if (iR == C) {
			break;
		}
	}

	//ll result = binary_search();
	ll result = sum;

	cout << result << endl;

	return 0;
}


Measured memory_bytes: 2560