#include<cstdio>
#include<cmath>
#include<cctype>
#include<cstring>
#include<iostream>
#include<string>
#include<sstream>
//stringstream ss(line)
#include<algorithm>
//sort(a,a+n,cmp)
//p=lower_bound(a,a+n,x)-a+1(大于或等于x的第一个位置)
#include<vector>
#include<bitset>
//bitset<N> xx

using namespace std;

const int U=3;
const int INF = 1e8;
vector<int>	save[U];
int LEN[U];

void print(){
	for(int i=0;i<U;i++){
		printf("\n*******\n");
		for(int j=0;j<LEN[i];j++){
			printf("%d ",save[i][j]);
		}
	}
	return ;
}

int main(){
	for(int i=0;i<U;i++)	scanf("%d",LEN+i);
	int d,d1,d2,d3;
	vector<int>::iterator pos;
	for(int i=0;i<U;i++){
		for(int j=0;j<LEN[i];j++){
			scanf("%d",&d);
			//pos = lower_bound(save[i].begin(),save[i].end(),d);
			//save[i].insert(pos,d);
			save[i].push_back(d);
		}
		sort(save[i].begin(),save[i].end());
	}
	//print();
	int min = INF;
	for(int i=0;i<U;i++){				//max
		for(int j=0;j<U;j++){			//min
			if(j==i)	continue;
			int k=3-i-j;
			for(int ii=LEN[i]-1;ii>=0;ii--){
				d1 = save[i][ii];
				int jj = lower_bound(save[j].begin(),save[j].end(),d1-min)-save[j].begin();
				int jjj = lower_bound(save[j].begin(),save[j].end(),d1)-save[j].begin();
				for(;jj<=jjj;jj++){
					d2 = save[j][jj];
					if(d2>d1) continue;
					d = lower_bound(save[k].begin(),save[k].end(),d2) - save[k].begin();
					d3 = save[k][d];
					if(d3<=d1&&d3>=d2){
						if(min>d1-d2){
							//printf("i=%d,j=%d,d1=%d,d2=%d,d3=%d\n",i,j,d1,d2,save[k][d]);
							min = d1-d2;
						}
					}
				}
			}
		}
	}
	printf("%d",min*2);
	return 0;
}