#include <iostream>
#include <queue>
#include <map>
#include <bitset>
#include <string>
#include <set>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <ctime>
//#include <unordered_map>
#include <stack>
#include <cstdlib>
#include <numeric>
#include <cassert>
#include <complex>
using namespace std;
#define maxn 5007
#define maxm 10007
#define maxq 1000007
#define maxl 1234
#define modn 998244353
#define scan(a) scanf("%d",&a)
#define scanl(a) scanf("%lld",&a)
#define scanl2(a,b) scanf("%lld%lld",&a,&b)
#define scans(a) scanf("%s",a)
#define scans2(a,b) scanf("%s%s",a,b)
#define scand(a) scanf("%lf",&a)
#define scan2(a,b) scanf("%d%d",&a,&b)
#define scand2(a,b) scanf("%lf%lf",&a,&b)
#define scan3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define scan4(a,b,c,d) scanf("%d%d%d%d",&a,&b,&c,&d)
#define scan5(a,b,c,d,e) scanf("%d%d%d%d%d",&a,&b,&c,&d,&e)
#define print(a) printf("%d\n",a);
#define printl(a) printf("%lld\n",a);
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define rrep(i,a,b) for(int i=a;i>= b;i--)
#define fscan(a) fscanf(stream,"%d", &a);
#define mp      make_pair	
#define pb      push_back
#define eb      emplace_back
#define mm(a,b) memset(a,b,sizeof a)
#define log2(n) (double)(log(n) / log(2.0))
#define _crt_disable_perfcrit_locks
#define bll __int128
typedef long long ll;
typedef unsigned long long ull;
const int inf = 0x3f3f3f3f;
typedef vector <int> vi;
typedef vector <ll> vll;
typedef map <ll, ll> mll;
typedef pair <ll, ll> pll;
typedef map <int, int> mii;
typedef pair <int, int> pii;
typedef map <char, int> mci;
typedef map <char, char> mcc;
typedef pair <char, int> pci;
typedef complex<double> cd;
typedef vector<complex<double> > vcd;

const double eps = 1e-8;
const double PI = 2 * acos(0.0);

int cc, bb; char ch; inline int F() {
	while (ch = getchar(), (ch < 48 || ch> 57) && ch != '-'); ch == '-' ? cc = bb = 0 : (cc = ch - '0', bb = 1);
	while (ch = getchar(), ch > 47 && ch < 58)cc = (cc << 1) + (cc << 3) + (ch ^ 48); return bb ? cc : -cc;
}
void write(int x) {
	int y = 10, len = 1;
	while (y <= x) { y *= 10; len++; }
	while (len--) { y /= 10; putchar(x / y + 48); x %= y; }
}
int x, y, a, b, c;
ll p[100007], q[100007], r[100007];
bool cmp(ll a, ll b) {
	return a > b;
}
priority_queue<ll, vector<ll>, greater<ll> > qp, qq;
int main() {
	//ios::sync_with_stdio(0);
	//cin.tie(0);
	//FILE* stream = fopen("L:/20.in", "rb+")
	cin >> x >> y >> a >> b >> c;
	for (int i = 0; i < a; i++)
		cin >> p[i];
	for (int i = 0; i < b; i++)
		cin >> q[i];
	for (int i = 0; i < c; i++)
		cin >> r[i];
	sort(p, p + a, cmp);
	sort(q, q + b, cmp);
	sort(r, r + c, cmp);
	for (int i = 0; i < x; i++)
		qp.push(p[i]);
	for (int i = 0; i < y; i++)
		qq.push(q[i]);
	ll res = 0, now = 0, pnow, qnow;
	while (!qp.empty() && !qq.empty()) {
		pnow = qp.top(), qnow = qq.top();
		if (pnow >= r[now] && qnow >= r[now])break;
		if (pnow < qnow) {//换p加的更多
			qp.pop();
			res += r[now++];
		}
		else {
			qq.pop();
			res += r[now++];
		}
	}
	while (!qp.empty()) {
		pnow = qp.top();
		if (pnow < r[now]) {
			qp.pop();
			res += r[now++];
		}
		else {
			res += pnow;
			qp.pop();
		}
	}
	while (!qq.empty()) {
		qnow = qq.top();
		if (qnow < r[now]) {
			qq.pop();
			res += r[now++];
		}
		else {
			res += qnow;
			qq.pop();
		}
	}
	cout << res << endl;
	return 0;
}

Measured memory_bytes: 4852