#include<iostream>
#include<vector>
#include<algorithm>
#define allr(x) (x).rbegin(),(x).rend()
using namespace std;

int in() {
	int x;
	cin >> x;
	return x;
}
int main() {
	int X, Y, A, B, C;
	cin >> X >> Y >> A >> B >> C;
	int N = X + Y;
	vector<int> p(A), q(B), r(C);
	int temp;
	while (A--) {
		cin >> p[A];
	}
	while (B--) {
		cin >> q[B];
	}
	sort(allr(p)); sort(allr(q));
	vector<int> T;
	while (X--) T.push_back(p[X]);
	while (Y--) T.push_back(q[Y]);
	while (C--) T.push_back(in());
	sort(allr(T));
	long long ans = 0ll;
	while (N--) {
		ans += T[N];
	}
	cout << ans;
	return 0;
}