#include<bits/stdc++.h>
using namespace std;
int leftz,rightz,te,small,homework[4];
int a[4][21];
void dfs(int x,int y){
	if(x>homework[y]){
	//	cout<<"left="<<leftz<<"right="<<rightz<<"max="<<max(leftz,rightz)<<endl;
		small=min(max(leftz,rightz),small);
		return ;
	}
	rightz+=a[x][y];
	dfs(x+1,y);
	rightz-=a[x][y];
	leftz+=a[x][y];
	dfs(x+1,y);
	leftz-=a[x][y];
}
int main(){
	cin>>homework[0]>>homework[1]>>homework[2]>>homework[3];
//	cout<<"next"<<endl;
	for(int i=0;i<4;i++){
		for(int j=0;j<homework[i];j++){
		//	cout<<"科目"<<i<<endl;
		//	cout<<"题记"<<j<<endl; 
		    cin>>a[j][i];
		}
		leftz=0;
		rightz=0;
		small=(long)1e18;
		
		dfs(0,i);
		//cout<<"small="<<small<<endl;
		te+=small;
	}
	cout<<te<<endl;
}