#include<bits/stdc++.h>
#define all(v) (v).begin(),(v).end()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define ri(x) scanf("%d",&(x))
#define ri2(x,y) scanf("%d %d",&(x),&(y))
#define ri3(x,y,z) scanf("%d %d %d",&(x),&(y),&(z))
#define rll(x) scanf("%lld",&(x))
#define rll2(x,y) scanf("%lld %lld",&(x),&(y))
#define rll3(x,y,z) scanf("%lld %lld %lld",&(x),&(y),&(z))
#define gc(x) ((x) = getchar())
using namespace::std;

const long double PI = acos(-1);
const long long MOD = 1000000000 +7;

typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<ll,pll> tll;
typedef pair<int,int> ii;
typedef pair<int,ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<pll> vpll;
typedef vector<tll> vtll;
typedef vector<string> vs;
typedef set<int> si;
typedef set<ii> sii;
typedef set<iii> siii;

ll gcd(ll a, ll b){ return b==0?a:gcd(b,a%b);}

ll add(ll a, ll b, ll m = MOD){
	if(a >= m) a %= m;
	if(b >= m) b %= m;
	if(a < 0) a += m;
	if(b < 0) b += m;
	ll res = a+b;
	if(res >= m or res <= -m) res %= m;
	if(res < 0) res += m;
	return res;
}

ll mul(ll a, ll b, ll m = MOD){
	if(a >= m) a %= m;
	if(b >= m) b %= m;
	if(a < 0) a += m;
	if(b < 0) b += m;
	ll res = a*b;
	if(res >= m or res <= -m) res %= m;
	if(res < 0) res += m;
	return res;
}

ll pow_mod(ll a, ll b, ll m = MOD){
	ll res = 1LL;
	a = a%m;
	while(b){
		if(b&1) res = mul(res,a,m);
		b >>= 1;
		a = mul(a,a,m);
	}
	return res;
}

ll fastexp(ll a, ll b){
	ll res = 1LL;
	while(b){
		if(b&1) res = res*a;
		b >>= 1;
		a *= a;
	}
	return res;
}

int gcdExtendido(int a, int b, int *x, int *y){
	if(a == 0){
		*x = 0;
		*y = 1;
		return b;
	}
	int x1, y1;
	int gcd = gcdExtendido(b%a,a,&x1,&y1);
	
	*x = y1-(b/a)*x1;
	*y = x1;
	return gcd;
}

int modInverso(int a, int m){
	int x, y;
	int g = gcdExtendido(a,m,&x,&y);
	if(g!=1) return -1;
	else return (x%m + m)%m;
}

/****************************************
*************P*L*A*N*T*I*L*L*A************
*****************************************/

const int N = 100000+5;

int n, m;
int a, b, c;
int p[N], q[N], r[N];
priority_queue<int,vi,greater<int>> Q1, Q2;

int main(){
	ri2(n,m);
	ri3(a,b,c);
	long long ans = 0LL;
	for(int i=1; i<=a; i++){
		ri(p[i]);
		if(Q1.size() == n){
			if(!Q1.empty()){
				if(Q1.top() < p[i]){
					ans -= Q1.top();
					Q1.pop();
					Q1.emplace(p[i]);
					ans += p[i];
				}
			}
			else{
				Q1.emplace(p[i]);
				ans += p[i];
			}
		}
		else{
			Q1.emplace(p[i]);
			ans += p[i];
		}
	}
	for(int i=1; i<=b; i++){
		ri(q[i]);
		if(Q2.size() == m){
			if(!Q2.empty()){
				if(Q2.top() < q[i]){
					ans -= Q2.top();
					Q2.pop();
					Q2.emplace(q[i]);
					ans += q[i];
				}
			}
			else{
				Q2.emplace(q[i]);
				ans += q[i];
			}
		}
		else{
			Q2.emplace(q[i]);
			ans += q[i];
		}
	}
	for(int i=1; i<=c; i++){
		ri(r[i]);
		int top1 = Q1.top();
		int top2 = Q2.top();
		if(Q1.size() < n){
			Q1.emplace(r[i]);
			ans += r[i];
			continue;
		}
		if(Q2.size() < m){
			Q2.emplace(r[i]);
			ans += r[i];
			continue;
		}
		if(top1 < r[i]){
			if(top2 < r[i]){
				if(r[i] - top1 < r[i] - top2){
					ans -= top2;
					ans += r[i];
					Q2.pop();
					Q2.emplace(r[i]);
				}
				else{
					ans -= top1;
					ans += r[i];
					Q1.pop();
					Q1.emplace(r[i]);
				}
			}
			else{
				ans -= top1;
				ans += r[i];
				Q1.pop();
				Q1.emplace(r[i]);
			}
		}
		else{
			if(top2 < r[i]){
				ans -= top2;
				Q2.pop();
				Q2.emplace(r[i]);
				ans += r[i];
			}
		}
	}
	printf("%lld\n",ans);
	return 0;
}


Measured memory_bytes: 2296