#include<bits/stdc++.h>
using namespace std;
int a[5],b[30];
long long ans=0;
int minn=INT_MAX;
int Left,Right;
void dfs(int x,int y){
	if(x>y){
		minn=min(minn,max(Left,Right));
		return;
	}
	Left+=b[x];
	dfs(x+1,y);
	Left-=b[x];
	Right+=b[x];
	dfs(x+1,y);
	Right-=b[x];
}
int main(){
	for(int i=1;i<=4;i++){
		cin>>a[i];
	}
	for(int i=1;i<=4;i++){
		Left=Right=0;
		minn=INT_MAX;
		memset(b,0,sizeof(b));
		for(int j=1;j<=a[i];j++){
			cin>>b[j];
		}
		dfs(1,i);
		ans+=minn;
	}
	cout<<ans; 
	return 0;
}