#include <iostream>
#include <functional>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <sstream>
#include <numeric>
#include <string>
#include <vector>
#include <cstdio>
#include <bitset>
#include <cmath>
#include <ctime>
#include <queue>
#include <stack>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <set>
#include <climits>

using namespace std;

#define pb push_back
#define sz(a) (int)a.size()
#define vi vector <int>
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define forn(i, n) for(int i = 0; i < n; ++i)
#define F first
#define S second
#define ll  long long
// typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;

// const ll inf = 1e9;
const double eps = 1e-9;
const double pi = acos(-1.0);
const int SZ = 55555;
const ll inf = 1e9;
const ll mod = inf + 7;

int main() {
	int n[3];
	cin >> n[0] >> n[1] >> n[2];
	vector <ll> minn(3, mod), sum(3, 0);
	ll allSum = 0, x;
	for (int i = 0; i < 3; ++i) {
		forn(j, n[i]) {
			cin >> x;
			sum[i] += x;
			minn[i] = min(minn[i], x);
		}
		allSum += sum[i];
	}
	ll diff = 2*mod;
	forn(i, 3) {
		diff = min(diff, sum[i]);
		forn (j, 3) {
			if (i != j) {
				diff = min(diff, minn[i] + minn[j]);
			}
		}
	}
// 	cout << allSum << endl;
	cout << allSum - diff*2 << endl;
	return 0;
}