#include<iostream>
#include<algorithm>
using namespace std;
int dfs(int* arr, int n);
int sum,ans;
int main()
{
	int s1[20] ={0} ,
		s2[20] = { 0 }, s3[20] = { 0 }, s4[20] = { 0 };
	int a1, a2, a3, a4;
	cin >> a1 >> a2 >> a3 >> a4;
	for (int i = 0; i < a1; i++)
		cin >> s1[i];
	for (int i = 0; i < a2; i++)
		cin >> s2[i];
	for (int i = 0; i < a3; i++)
		cin >> s3[i];
	for (int i = 0; i < a4; i++)
		cin >> s4[i];
	ans +=dfs(s1, a1);
	sum = 0;
	ans +=dfs(s2, a2);
	sum = 0;
	ans +=dfs(s3, a3);
	sum = 0;
	ans += dfs(s4, a4);
	
	cout << ans;
	return 0;
}
int dfs(int* arr,int n)
{
	sort(arr, arr + n, greater<int>());
	if (arr[1] == 0)
		return sum + arr[0];
	arr[0] -= arr[1];  sum += arr[1]; arr[1] = 0;
	dfs(arr, n);

}