#include "bits/stdc++.h"
using namespace std;
#define pb          push_back
#define ll          long long
#define mp          make_pair
#define pii         pair<int,int>
#define vi          vector<int>
#define vii         vector<pii>
#define mi          map<int,int>
#define mii         map<pii,int>
#define all(a)      (a).begin(),(a).end()
#define x           first
#define y           second
#define sz(x)       (int)x.size()
#define endl        '\n'
#define MOD         1000000007
#define hell        1000000007
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define rep(i,a,b)  for(int i=a;i<b;i++)
#define rev(i,a,b)  for(int i=a;i>=b;i--)
#define ll          long long
#define bg(i)       i.begin()
#define fset(it,s)   for(auto it = s.begin(); it != s.end(); it++)
 
 
#define track(x)                cerr<<#x<<": "<<x<<endl
#define track2(x, y)             cerr<<#x<<": "<<x<<" | "<<#y<<": "<<y<<endl
#define track3(x, y, z)          cerr<<#x<<":" <<x<<" | "<<#y<<": "<<y<<" | "<<#z<<": "<<z<<endl
#define track4(a, b, c, d)       cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<endl
 
#define ed(i)       i.end()
#define mem(a)      memset(a, 0, sizeof(a))
ll mult(ll a,ll b, ll p=MOD){return ((a%p)*(b%p))%p;}
ll add(ll a, ll b, ll p=MOD){return (a%p + b%p)%p;}
ll fpow(ll n, ll k, ll p = MOD) {ll r = 1; for (; k; k >>= 1LL) {if (k & 1LL) r = mult(r,n,p); n = mult(n,n,p);} return r;}
ll inv(ll a, ll p = MOD) {return fpow(a, p - 2, p);}
void self_max(int &a, int &b) {a = max(a, b); }
void self_min(int &a, int &b) {a = min(a, b); }

const ll sizes  = 1e7+1;
const ll mod  = 1000000007;

ll n, m , k , o , p;
// ll a[sizes];

void solve(){
    cin >> n >> m >> k;
    ll sum1 = 0 , sum2 = 0 , sum3 = 0 , sum = 0;
    vector<ll>a , b , c, d;
    for(int i = 0 ;  i < n ; i++){
        cin >> o;
        a.pb(o);
        sum += o;
     
        sum1+=o;
    }
    for(int i = 0 ; i < m ; i++){
        cin >> o;
        b.pb(o);
        sum2 += o;
        sum += o;
    }
    for(int i = 0 ; i < k ; i++){
        cin >> o;
        c.pb(o);
        sum3 += o;
        sum += o;
    }

    sort(all(a));sort(all(b));sort(all(c));
    d.push_back(a[0]);
    d.pb(b[0]);
    d.pb(c[0]);
    sort(all(d));
    ll mn = min(min(sum1 , sum2) , sum3);
    mn = min(mn , d[0] + d[1]);

    cout << sum - (2 * mn) << endl;;
}

int main() {
    ios::sync_with_stdio(false);
    cout<<fixed<<setprecision(2);
    cin.tie(0);
    cout.tie(0);
    // fun();
    int t = 1;
    // cin >> t;  
    int p = t;  
    while(t--){
        solve();
    }   
}

 