#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define sc(x) scanf("%d",&x)
#define _sc(x) scanf("%lld",&x)
#define pf(x) printf("%d",x);
#define _pf(x) printf("%lld",x);
#define FOR(i,a,b) for(int i = a;i<=b;++i)
#define _FOR(i,a,b) for(int i = a;i<b;++i)

const ll mod = 1e9+7;
const ll maxn = 1e6+10;
const double eps = 1e-6;
const int INF = INT_MAX;

ll pow2(ll a,ll n){ ll res = 1ll;while(n){if(n&1) res = (res*a)%mod;a = (a*a)%mod;n >>= 1;}return res;}

ll gcd(ll a,ll b){ return b?gcd(b,a%b):a; }

int T;
int n1,n2,n3;
ll a[5];
ll b[5][maxn];
ll mi[5];
ll cnt[5];
void solve(){
	mi[1] = mi[2] = mi[3] = INT_MAX;
	sc(a[1]);sc(a[2]);sc(a[3]);
	ll sum = 0;
	FOR(i,1,3){
		FOR(j,1,a[i]){
			_sc(b[i][j]);
			sum += b[i][j];
			cnt[i] += b[i][j];
			mi[i] = min(mi[i],b[i][j]);
		}
	}
	ll ans = 0;
	ans = max(ans,sum-2ll*(mi[1]+mi[2]));
	ans = max(ans,sum-2ll*(mi[1]+mi[3]));
	ans = max(ans,sum-2ll*(mi[2]+mi[3]));
	ans = max(ans,sum-2ll*cnt[1]);
	ans = max(ans,sum-2ll*cnt[2]);
	ans = max(ans,sum-2ll*cnt[3]);
	_pf(ans);
	cout << "\n";
}
int main(void){
	T = 1;
	while(T--){
		solve();
	}
	
	return 0;
} 
