// Mayank Goyal
#include<bits/stdc++.h>

#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define sz(x) ((int)x.size())
#define ln(x) ((int)x.length())
#define clr(x,v) memset(x, v, sizeof(x))
#define ld long double
#define pi pair<int,int>
#define int long long int
#define mp make_pair
#define pb push_back
#define fi first
#define se second

using namespace std;

const int N = 1e6+5;
const int MOD = 1e9+7;

int32_t main(){
    // int t;cin>>t;while(t--)
    {
        int a,b,c,s=0,x;
        cin>>a>>b>>c;
        vector<int> v={INT_MAX,INT_MAX,INT_MAX};
        int s1,s2,s3;
        s1=s2=s3=0;

        for(int i=0;i<a;i++){
            cin>>x;
            v[0]=min(v[0],x);
            s1+=x;
        } 
        for(int i=0;i<b;i++){
            cin>>x;
            v[1]=min(v[1],x);
            s2+=x;
        } 
        for(int i=0;i<c;i++){
            cin>>x;
            v[2]=min(v[2],x);
            s3+=x;
        } 

        sort(all(v));

        vector<int> av;
        av.pb(s1);
        av.pb(s2);
        av.pb(s3);

        sort(all(av));
        s = s1+s2+s3;
        cout<<max((av[1]+av[2]-av[0]),(s-2*v[0]-2*v[1]))<<"\n";

    }
}
