#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define clr(a) memset(a, 0, sizeof(a))
#define sz(x) x.size()
#define printvector(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout<<*it<<" "; cout<<endl;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, x, y) for (int i = x; i < y; i++)
#define DEC(i, x, y) for (int i = x; i >= y; i--)
#define all(v) v.begin(), v.end()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define alla(a, n) a, a + n
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (a * b)/gcd(a, b)
#define int long long int
#define ull unsigned long long
#define printarray(arr, n) for(int i= 0;i<n;i++) cout<<arr[i]<<' '; cout<<endl;
#define printvecpairs(vec) for(auto it: vec) cout<<it.fr<<' '<<it.sc<<endl;
#define initdp(a) memset(a, -1, sizeof(a));
#define endl '\n'
#define float long double

using namespace std;
const int MOD = 1e9 + 7;
const int INF = 2e15;
const int MAXN = 1e5 + 5;

int fastexpo(int b, int exp){
    if(exp == 0) return 1;
    if(exp == 1) return b;
    int ans = (fastexpo(b,exp/2) % MOD);
    ans *= ans;
    ans %= MOD;
    if(exp % 2 == 1){
        ans *= b;
    }
    ans %= MOD;
    return ans;
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    #endif
    int n1, n2, n3;
    cin>>n1>>n2>>n3;
    int a[n1], b[n2], c[n3];
    int mn1 = INT_MAX, mn2 = INT_MAX, mn3 = INT_MAX;
    int sm1 = 0, sm2 = 0, sm3 = 0;
    for(int i= 0;i<n1;i++){
    	cin>>a[i];
    	mn1 = min(mn1, a[i]);
    	sm1 += a[i];
    }
    for(int i= 0;i<n2;i++){
    	cin>>b[i];
    	mn2 = min(mn2, b[i]);
    	sm2 += b[i];
    }
    for(int i= 0;i<n3;i++){
    	cin>>c[i];
    	mn3 = min(mn3, c[i]);
    	sm3 += c[i];
    }
    int ans = sm1 + sm2 + sm3;
    ans -= 2*(mn1+mn2+mn3-max3(mn1, mn2, mn3));
    ans = max(ans, sm1 + sm2 + sm3 - (2 * min3(sm1, sm2, sm3)));
   	cout<<ans<<endl;
    return 0;
}



