#include <bits/stdc++.h>
using namespace std;

int main() {
	int Na, Nb, Nc;
	cin >> Na >> Nb >> Nc;
	vector<pair<int, int>> S;
	for (int i = 0; i < Na; i++){
		int A;
		cin >> A;
		S.push_back(make_pair(A, 0));
	}
	for (int i = 0; i < Nb; i++){
		int B;
		cin >> B;
		S.push_back(make_pair(B, 1));
	}
	for (int i = 0; i < Nc; i++){
		int C;
		cin >> C;
		S.push_back(make_pair(C, 2));
	}
	int Sa = 0, Sb = 0, Sc = 0, A = 0, B = 0, C = 0;
	sort(S.rbegin(), S.rend());
	long long ans = 0;
	for (int i = 0; i < Na + Nb + Nc; i++){
		auto [p, n] = S[i];
		if (n == 0){
			Sa++;
			A += p;
		}
		if (n == 1){
			Sb++;
			B += p;
		}
		if (n == 2){
			Sc++;
			C += p;
		}
		long long m = (long long) A * Sb + (long long) B * Sc + (long long) C * Sa;
		if (ans <= m){
			ans = m;
		} else {
			if (n == 0){
				Sa--;
				A -= p;
			}
			if (n == 1){
				Sb--;
				B -= p;
			}
			if (n == 2){
				Sc--;
				C -= p;
			}
		}
	}
	cout << ans << endl;
}