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



int main(){
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(ios::badbit | ios::failbit);
	array<int, 3> n;
	cin >> n[0] >> n[1] >> n[2];
	array<vector<int>, 3> a;
	for(auto i = 0; i < 3; ++ i){
		a[i].resize(n[i]);
		copy_n(istream_iterator<int>(cin), n[i], a[i].begin());
		ranges::sort(a[i] | ranges::views::reverse);
		a[i].insert(a[i].begin(), 0);
		for(auto j = 0; j < n[i]; ++ j){
			a[i][j + 1] += a[i][j];
		}
	}
	auto eval = [&](int p0, int p1, int p2)->long long{
		return 1LL * a[0][p0] * p1 + 1LL * a[1][p1] * p2 + 1LL * a[2][p2] * p0;
	};
	auto get2 = [&](int p0, int p1)->int{
		return *ranges::partition_point(ranges::iota_view(0, n[2]), [&](int p2){ return eval(p0, p1, p2) < eval(p0, p1, p2 + 1); });
	};
	auto get1 = [&](int p0)->int{
		return *ranges::partition_point(ranges::iota_view(0, n[1]), [&](int p1){ return eval(p0, p1, get2(p0, p1)) < eval(p0, p1 + 1, get2(p0, p1 + 1)); });
	};
	auto get0 = [&]()->int{
		return *ranges::partition_point(ranges::iota_view(0, n[0]), [&](int p0){
			int p10 = get1(p0), p11 = get1(p0 + 1);
			return eval(p0, p10, get2(p0, p10)) < eval(p0 + 1, p11, get2(p0 + 1, p11));
		});
	};
	int p0 = get0(), p1 = get1(p0), p2 = get2(p0, p1);
	cout << eval(p0, p1, p2) << "\n";
	return 0;
}

/*

*/

////////////////////////////////////////////////////////////////////////////////////////
//                                                                                    //
//                                   Coded by Aeren                                   //
//                                                                                    //
////////////////////////////////////////////////////////////////////////////////////////