#include<algorithm>
#include<cstring>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<vector>
#include<cmath>
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn=2e4+34;
int inf=0x3f3f3f3f;
int vis[maxn],idx,cnt,tot,a[maxn];
int n[9],MIN;
int dp[60][2000];
void work(){
	for(int i=1;i<=4;i++)scanf(" %d",&n[i]);
	for(int i=1;i<=4;i++){
		int sum=0;
		memset(dp,0,sizeof(dp));
		for(int j=1;j<=n[i];j++)scanf(" %d",&a[j]),sum+=a[j];
		for(int j=1;j<=n[i];j++){
			for(int k=sum/2;k>=a[j];k--)
			dp[j][k]=max(dp[j-1][k],dp[j-1][k-a[j]]+a[j]);
		}
		tot+=sum-dp[n[i]][sum/2];
	}
	printf("%d\n",tot);
}
int main()
{
    work();
    return 0;
}