//
// author  : Abhishek
//
#include <bits/stdc++.h>


#define ll long long
#define db double
#define deb(x) cout<<#x<<": "<<x<<"\n"
#define all(x) x.begin(),x.end()
#define fo(i, n) for(i=0 ; i<n ; i++)
#define Fo(i, k, n) for(i=k ; i<n ; i++)
#define setBits(x) __builtin_popcountll(x)
#define parity(x) __builtin_parity(x)

using namespace std;

const ll MOD = 1000000007;
const ll N = 300005;  // array size
const ll inf = 10000000000000000;
const db PI = 3.141592653589793238462;


void print(vector<ll> v) {
    ll i;
    fo(i, v.size())cout << v[i] << " ";
    cout << "\n";
}

void print(vector<pair<ll, ll> > v) {
    ll i;
    fo(i, v.size()) {
        cout << v[i].first << " " << v[i].second << "\n";
    }
}

vector<ll> read(ll n) {
    ll i;
    vector<ll> arr(n, 0);
    fo(i, n)cin >> arr[i];
    return arr;
}

vector<ll> read(ll n, ll k) {
    ll i;
    vector<ll> arr(n + k, 0);
    Fo(i, k, n + k)cin >> arr[i];
    return arr;
}


void size(ll byte) {
    db bytes = byte;
    db KB = bytes / 1024;
    db MB = KB / 1024;
    cout << fixed << setprecision(2) << "bytes: " << bytes << "\n";
    cout << fixed << setprecision(2) << "KB: " << KB << "\n";
    cout << fixed << setprecision(2) << "MB: " << MB << "\n";
}

bool isEven(ll n) {
    return n % 2 == 0;
}

bool isOdd(ll n) {
    return n % 2 != 0;
}

/*

*/

void solve() {
    ll t = 1, cs = 1;
//    cin >> (t);
    while (t--) {

        ll i, j, k, n, c, m, p, q, x, y, a, b, l, r;
        cin >> a >> b >> c;
        ll s1 = 0, s2 = 0, s3 = 0;
        ll m1 = INT_MAX, m2 = INT_MAX, m3 = INT_MAX;
        fo(i, a) {
            cin >> x;
            s1 += x;
            m1 = min(m1, x);
        }
        fo(i, b) {
            cin >> x;
            s2 += x;
            m2 = min(m2, x);
        }
        fo(i, c) {
            cin >> x;
            s3 += x;
            m3 = min(m3, x);
        }
        vector<ll> temp = {m1, m2, m3};
        sort(all(temp));
        ll op1 = s1 + s2 + s3 - 2 * (temp[0] + temp[1]);
        ll op2 = s1 + s2 - s3;
        ll op3 = s1 - s2 + s3;
        ll op4 = -s1 + s2 + s3;
        cout << max(op1, max(op2, max(op3, op4))) << "\n";
    }
}


int main() {

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    solve();

    return 0;
}
