#include <bits/stdc++.h>//For vectors,pairs
using namespace std;

#define ll long long
#define rep(i,j,n)  for(int i=j;i<n;i++)
#define _rep(i,n) for(int i=n;i>=0;i--)

void solve();

void cp(){
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("error.txt", "w", stderr);
    freopen("output.txt", "w", stdout);
    #endif
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cp();
    int t=1;//cin>>t;
    while(t--){
        solve();
        cout<<endl;
    }

    cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" secs"<<endl;
    return 0;
}
void solve(){
    ll n1,n2,n3;
    cin >> n1>>n2>>n3;
    vector<ll> v1(n1,0),v2(n2,0),v3(n3,0);
    ll s1=0,s2=0,s3=0;
    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];
    }
    // CASE I 2 arrays - 1 arrays
    sort(v1.begin(),v1.end());
    sort(v2.begin(),v2.end());
    sort(v3.begin(),v3.end());
    ll sum1 = s1+s2+s3-2*(min(min(s1,s2),min(s2,s3)));
    // CASE II sum if all except 2 - those 2
    ll m1 = min(v1[0],v2[0]);
    ll m2 =100;
    if(m1 == v1[0]){
        m2 = min(v2[0],v3[0]);
    }
    if(m1 == v2[0]){
        m2 = min(v1[0],v3[0]);
    }
    ll sum2 = s1+s2+s3-2*(m1+m2);
    //cout<<s1+s2+s3;
    //cout<<endl<<m1<<endl<<m2<<endl;
    cout<<max(sum1,sum2);
    return;
}
