#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<map>
#include<vector>
#include<queue>
#include<set>
#define IL inline
#define x first
#define y second
typedef long long ll;
#define int long long
using namespace std;
const int N=300010;
ll a[N],b[N],c[N];
int sa[N],sb[N],sc[N];
int n1,n2,n3;
signed main()
{
	int t;
//	scanf("%d",&t);
//	while(t--)
	{
		scanf("%d%d%d",&n1,&n2,&n3);
		for(int i=1;i<=n1;i++)
		scanf("%lld",&a[i]);
		for(int i=1;i<=n2;i++)
		scanf("%lld",&b[i]);
		for(int i=1;i<=n3;i++)
		scanf("%lld",&c[i]);
		
		int res=0;
		sort(a+1,a+1+n1);
		sort(b+1,b+1+n2);
		sort(c+1,c+1+n3);
		a[n1+1]=0;
		b[n2+1]=0;
		c[n3+1]=0;
		for(int i=1;i<=n1;i++)
		sa[i]=sa[i-1]+a[i];
		for(int i=1;i<=n2;i++)
		sb[i]=sb[i-1]+b[i];
		for(int i=1;i<=n3;i++)
		sc[i]=sc[i-1]+c[i];
		int sum=sa[n1]+sb[n2]+sc[n3];
		res=max(res,sum-2*sa[n1]);
		res=max(res,sum-2*sb[n2]);
		res=max(res,sum-2*sc[n3]);
		res=max(res,sum-2*a[1]-2*b[1]);
		res=max(res,sum-2*a[1]-2*c[1]);
		res=max(res,sum-2*b[1]-2*c[1]);
		printf("%lld\n",res);
	}
    return 0;
}



