#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
#define rep(i, a, n) for (int i=(a); i<(n); i++)
#define per(i, a, n) for (int i=(a); i>(n); i--)
typedef long long ll;
const int maxn = 2e5+5;
const int mod = 1e9+7;
using namespace std;

void solve() {
	ll n1,n2,n3,ans=0,s1=0,s2=0,s3=0; cin >> n1 >> n2 >> n3;
	vector<ll> v1(n1), v2(n2), v3(n3), tmp;
	rep(i,0,n1) cin >> v1[i], s1 += v1[i];
	rep(i,0,n2) cin >> v2[i], s2 += v2[i];
	rep(i,0,n3) cin >> v3[i], s3 += v3[i];
	ll res = s1+s2+s3;
	sort(v1.begin(), v1.end());
	sort(v2.begin(), v2.end());
	sort(v3.begin(), v3.end());
	ans = max({res-v1[0]*2-v2[0]*2, res-v2[0]*2-v3[0]*2, res-v1[0]*2-v3[0]*2});
	ans = max({ans, res - s1*2, res - s2*2, res - s3*2});
	
	cout << ans << '\n';
}

int main(int argc, char * argv[]) {
	ios_base::sync_with_stdio(false); cin.tie(0);
	//int t; cin >> t; while(t--)
	solve();

    return 0;
}