#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define all(a) (a).begin(), (a).end()
#define ar array
#define watch(x) cout << (#x) << " = " << (x) << "\n";
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;


void solve(){
    ll n[3];
    ll maxi = 0;
    ll sum[3];
    ll mini[3];
    memset(sum, 0ll, sizeof(sum));
    mini[0] = mini[1] = mini[2] = 1e9+7;
    for(int i=0;i<3;i++){
        cin >> n[i];
        maxi = max(maxi, n[i]);
    }
    ll a[maxi][3];
    for(int i=0;i<3;i++){
        for(int j=0;j<n[i];j++){
            cin >> a[j][i];
            sum[i]+=a[j][i];
            mini[i] = min(mini[i], a[j][i]);
        }
    }
    ll ans = 0;
    for(int i=0;i<3;i++){
        ll temp = sum[(i+1)%3] + sum[(i+2)%3] + (abs(sum[i]-mini[i] - min(mini[(i+1)%3], mini[(i+2)%3])) - mini[i] - min(mini[(i+1)%3], mini[(i+2)%3]));
        ans = max(ans, temp);
    }
    cout << ans << "\n";
}


int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t=1;
    // cin >> t;
    while(t--){
        solve();
    }
    return 0;
}
