满江红

//P2392.cpp
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int n[5],a[50],sum;
int main(){
	cin>>n[1]>>n[2]>>n[3]>>n[4];
	for(int id=1;id<=4;id++){
		for(int i=1;i<=n[id];i++) cin>>a[i];
		int minn=60;
		for(int i=1;i<=(1<<n[id])-1;i++){
			int l=0,r=0,x=i;
			for(int j=1;j<=n[id];j++){
				if((x&1)==1) l+=a[j];
				else r+=a[j];
				x>>=1;
			}
			if(max(l,r)<minn) minn=max(l,r);
		}
		sum+=minn;
	}
	cout<<sum<<"\n";
	return 0;
}