#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define pll pair<ll,ll>
#define pi 3.14159265358979323846
const ll MOD=1e9+7;
using namespace std;
ll POWER(ll base,ll expo)
{
    ll ret=1;
    while(expo)
    {
        if(expo&1)ret=ret*base;
        expo>>=1;
        base=base*base;
    }
    return ret;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    ll test_case=1; //cin>>test_case;
    while(test_case--)
    {
        ll n1,n2,n3;cin>>n1>>n2>>n3;
        ll a1[n1],a2[n2],a3[n3];
        ll sum1=0,sum2=0,sum3=0;

        for(ll i=0;i<n1;i++){
            cin>>a1[i];
            sum1+=a1[i];
        }
        for(ll i=0;i<n2;i++){
            cin>>a2[i];
            sum2+=a2[i];
        }
        for(ll i=0;i<n3;i++){
            cin>>a3[i];
            sum3+=a3[i];
        }
        sort(a1,a1+n1);
        sort(a2,a2+n2);
        sort(a3,a3+n3);
        ll ans=-1e18;
        ans=max(ans,sum1+sum2-sum3);
        ans=max(ans,sum1+sum3-sum2);
        ans=max(ans,sum3+sum2-sum1);

        ans=max(ans,sum1+sum2+sum3-2*(a1[0]+a2[0]));
        ans=max(ans,sum1+sum2+sum3-2*(a1[0]+a3[0]));
        ans=max(ans,sum1+sum2+sum3-2*(a3[0]+a2[0]));

        cout<<ans;
    }
    return 0;
}
