#include<stdio.h>
#include<bits/stdc++.h>
using namespace std;
int cmp(int a,int b)
{
	if(a>b) return 1;
	else return 0;
}
int main()
{
	int a,b,c,d,ah[65],bh[65],ch[65],dh[65],min=0,max=0,i,j=0,sum=0;
	scanf("%d%d%d%d",&a,&b,&c,&d);
	for(i=0;i<a;i++)
	  scanf("%d",&ah[i]);
	sort(ah,ah+a,cmp);
	j=0;
	max=0;min=0;
	while(j<a)
	{
        if(max<=min)
        {
        	max=max+ah[j];
        	j++;
        }
        else
		{
			min=min+ah[j];
			j++;
        } 
	}
	if(max>=min) sum=sum+max;
	else sum=sum+min;
	
	for(i=0;i<b;i++)
	  scanf("%d",&bh[i]);
	sort(bh,bh+b,cmp);
	j=0;
	max=0;min=0;
	while(j<b)
	{
        if(max<=min)
        {
        	max=max+bh[j];
        	j++;
        }
        else
		{
			min=min+bh[j];
			j++;
        }
	}
	if(max>=min) sum=sum+max;
	else sum=sum+min;
	
	for(i=0;i<c;i++)
	  scanf("%d",&ch[i]);
	sort(ch,ch+c,cmp);
	j=0;
	max=0;min=0;
	while(j<c)
	{
        if(max<=min)
        {
        	max=max+ch[j];
        	j++;
        }
        else
		{
			min=min+ch[j];
			j++;
        } 
	}
	if(max>=min) sum=sum+max;
	else sum=sum+min;
	
	for(i=0;i<d;i++)
	  scanf("%d",&dh[i]);
	sort(dh,dh+d,cmp);
	j=0;
	max=0;min=0;
	while(j<d)
	{
        if(max<=min)
        {
        	max=max+dh[j];
        	j++;
        }
        else
		{
			min=min+dh[j];
			j++;
        } 
	}
	if(max>=min) sum=sum+max;
	else sum=sum+min;
	printf("%d\n",sum);
	return 0;
}