1 #include<iostream>
2 using namespace std;
3 #include<cstdio>
4 #include<vector>
5 #include<functional>
6 #include<algorithm>
7 typedef long long ll;
8 int a[110000],b[110000],c[110000];
9 int ans=0x7fffffff;
10 void ss(int a[],int b[],int c[],int n,int m,int l)
11 {
12 for (int i=0;i<n;i++)
13 {
14 int pointa=a[i];
15 int pointb=0x7fffffff/4,pointc=0x7fffffff/4;
16 int ptb = lower_bound(b, b+m, pointa)-b;
17 int ptc = lower_bound(c, c+l, pointa)-c;
18 if (ptb>=0&&ptb<m) pointb=b[ptb];
19 if (ptc>=0&&ptc<l) pointc=c[ptc];
20 int zans=abs(pointa-pointb)+abs(pointa-pointc)+abs(pointb-pointc);
21 // cout<<zans<<" "<<ptb<<" "<<ptc<<" "<<i<<" "<<pointa<<" "<<pointb<<" "<<pointc<<endl;
22 if (ans>zans) ans=zans;
23 }
24 }
25 int main()
26 {
27 int n,m,l;
28 cin>>n>>m>>l;
29 for (int i=1;i<=n;i++)
30 {
31 scanf("%d",&a[i-1]);
32 }
33 for (int i=1;i<=m;i++)
34 {
35 scanf("%d",&b[i-1]);
36 }
37 for (int i=1;i<=l;i++)
38 {
39 scanf("%d",&c[i-1]);
40 }
41 sort(a,a+n);sort(b,b+m);sort(c,c+l);
42 ss(a,b,c,n,m,l);
43 ss(a,c,b,n,l,m);
44 ss(c,b,a,l,m,n);
45 ss(b,a,c,m,n,l);
46 ss(c,a,b,l,n,m);
47 ss(b,c,a,m,l,n);
48 cout<<ans<<endl;
49 return 0;
50 }