//Sameer's Code
#include<bits/stdc++.h>
using namespace std;
#define print(a) for (int i = 0; i < n; i++) {cout << a[i] << " ";}
#define allsort(a) sort(a.begin(),a.end());
#define allsorta(a) sort(a,a+n);
#define all(a) a.begin(),a.end()
#define ll long long
#define endl "\n"
#define MOD 1000000007
#define pb push_back
const int N = 0;
/*
Test case area
*/
void solve()
{
	ll n1, n2, n3;
	cin >> n1 >> n2 >> n3;
	vector<ll>v1(n1, 0);
	vector<ll>v2(n2, 0);
	vector<ll>v3(n3, 0);
	ll sum1 = 0, sum2 = 0, sum3 = 0;
	ll m1 = INT_MAX, m2 = INT_MAX, m3 = INT_MAX;
	for (int i = 0; i < n1; i++)
	{
		cin >> v1[i];
		sum1 += v1[i];
	}
	for (int i = 0; i < n2; i++)
	{
		cin >> v2[i];
		sum2 += v2[i];
	}
	for (int i = 0; i < n3; i++)
	{
		cin >> v3[i];
		sum3 += v3[i];
	}
	m1 = *min_element(all(v1));
	m2 = *min_element(all(v2));
	m3 = *min_element(all(v3));
	ll sum = sum1 + sum2 + sum3;
	ll res = min({m1 + m2, m2 + m3, m3 + m1});
	ll res2 = min({sum1, sum2, sum3});
	ll ans = max(sum - (2 * res), sum - (2 * res2));
	cout << ans << endl;
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r" , stdin);
	freopen("output.txt", "w", stdout);
#endif
	long long int t = 1;
	//cin >> t;
	for (int tt = 0; tt < t; tt++)
	{
		solve();
	}
	return 0;
}