#ifdef LOCAL
#pragma warning(disable:4996)
#pragma warning(disable:4244)
#pragma warning(disable:4554)
#define gets gets_s

#endif
#include<map>
#include<set>
#include<list>
#include<cmath>
#include<stack>
#include<queue>
#include<cmath>
#include<vector>
#include<string>
#include<cctype>
#include<cstdio>
#include<bitset>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<memory>
#include<iomanip>
#define ll long long
#define cl(a,x) memset((a),(x),sizeof(a))
#define lson 2*i
#define rson 2*i+1
#define sf scanf
#define ull unsigned long long
#define lowbit(x) (x)&(-x)
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pdd pair<double,double>
#define ti tree[i]
#define endl "\n"
#define debug(num) #num << "=" << num << " "
ll q_pow(ll x, ll n, ll mod) { ll ret = 1; while (n) { if (n & 1) ret = x * ret%mod; x = x * x%mod; n >>= 1; }return ret; }
ll __gcd(ll x, ll y) { if (!y) return x; return __gcd(y, x%y); }
ll getbit(ll now) { int cnt = 0; while (now) { cnt++; now -= lowbit(now); }return cnt; }
int dx[] = { -1,1,0,0 };//上下左右
int dy[] = { 0,0,-1,1 };//
using namespace std;
const ll maxn = 3e5 + 10;
const ll maxm = 2e7 + 10;
const ll INF = 0x3f3f3f3f;
const ll IINF = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-9;
const int mod = 1e9 + 7;
void add(ll &a, ll num) { a += num; if (a >= mod) a -= mod; }
void sub(ll &a, ll num) { a -= num;	if (a < 0) a += mod; }

ll a[4][maxn];
ll len[4];
ll sum[4];
ll maxnum[4];

void solve() {
	for (int i = 1; i <= 3; i++)
		sf("%lld", &len[i]);
	for (int i = 1; i <= 3; i++)
		for (int j = 1; j <= len[i]; j++)
			sf("%lld", &a[i][j]);

	for (int i = 1; i <= 3; i++) {
		maxnum[i] = IINF;
		for (int j = 1; j <= len[i]; j++) {
			sum[i] = sum[i] + a[i][j];
			maxnum[i] = min(maxnum[i], a[i][j]);
		}
		maxnum[i] *= 2;
	}

	ll ans = 0;
	ans = max(ans, sum[1] + sum[2] - sum[3]);
	ans = max(ans, sum[1] + sum[3] - sum[2]);
	ans = max(ans, sum[2] + sum[3] - sum[1]);
	ll sumnum = 0;
	sumnum = sum[1] + sum[2] + sum[3];
	ans = max(ans, sumnum - maxnum[1] - maxnum[2]);
	ans = max(ans, sumnum - maxnum[3] - maxnum[2]);
	ans = max(ans, sumnum - maxnum[1] - maxnum[3]);
	printf("%lld\n", ans);
}

signed main(int argc, char *argv[]) {
	if (argc == 2 && strcmp("-debug", argv[1]) == 0) {
		freopen("in.txt", "r", stdin);
		freopen("out.txt", "w", stdout);
	}

	///cout << fixed << setprecision(20);ios::sync_with_stdio(false);
	int t = 1;
	///cin >> t;

	while (t--) {
		solve();
	}

	return 0;
}