#include using namespace std; #define rep(i, n) for (int i = 0; i < (n); i++) #define per(i, n) for (int i = (n)-1; i >= 0; i--) #define rep2(i, l, r) for (int i = (l); i < (r); i++) #define per2(i, l, r) for (int i = (r)-1; i >= (l); i--) #define each(e, v) for (auto &e : v) #define MM << " " << #define pb push_back #define eb emplace_back #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) #define sz(x) (int)x.size() using ll = long long; using pii = pair; using pil = pair; using pli = pair; using pll = pair; template using minheap = priority_queue, greater>; template using maxheap = priority_queue; template bool chmax(T &x, const T &y) { return (x < y) ? (x = y, true) : false; } template bool chmin(T &x, const T &y) { return (x > y) ? (x = y, true) : false; } template int flg(T x, int i) { return (x >> i) & 1; } int pct(int x) { return __builtin_popcount(x); } int pct(ll x) { return __builtin_popcountll(x); } int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); } int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); } int botbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); } int botbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); } template void print(const vector &v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' '); if (v.empty()) cout << '\n'; } template void printn(const vector &v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cout << v[i] + x << '\n'; } template int lb(const vector &v, T x) { return lower_bound(begin(v), end(v), x) - begin(v); } template int ub(const vector &v, T x) { return upper_bound(begin(v), end(v), x) - begin(v); } template void rearrange(vector &v) { sort(begin(v), end(v)); v.erase(unique(begin(v), end(v)), end(v)); } template vector id_sort(const vector &v, bool greater = false) { int n = v.size(); vector ret(n); iota(begin(ret), end(ret), 0); sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; }); return ret; } template void reorder(vector &a, const vector &ord) { int n = a.size(); vector b(n); for (int i = 0; i < n; i++) b[i] = a[ord[i]]; swap(a, b); } template T floor(T x, T y) { assert(y != 0); if (y < 0) x = -x, y = -y; return (x >= 0 ? x / y : (x - y + 1) / y); } template T ceil(T x, T y) { assert(y != 0); if (y < 0) x = -x, y = -y; return (x >= 0 ? (x + y - 1) / y : x / y); } template pair operator+(const pair &p, const pair &q) { return make_pair(p.first + q.first, p.second + q.second); } template pair operator-(const pair &p, const pair &q) { return make_pair(p.first - q.first, p.second - q.second); } template istream &operator>>(istream &is, pair &p) { S a; T b; is >> a >> b; p = make_pair(a, b); return is; } template ostream &operator<<(ostream &os, const pair &p) { return os << p.first << ' ' << p.second; } struct io_setup { io_setup() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed << setprecision(15); cerr << fixed << setprecision(15); } } io_setup; constexpr int inf = (1 << 30) - 1; constexpr ll INF = (1LL << 60) - 1; // constexpr int MOD = 1000000007; constexpr int MOD = 998244353; void solve() { vector N(3); rep(i, 3) cin >> N[i]; vector> a(3); rep(i, 3) { a[i].resize(N[i]); rep(j, N[i]) cin >> a[i][j]; sort(rall(a[i])); } vector> s(3); rep(i, 3) { s[i].resize(N[i] + 1, 0); rep(j, N[i]) s[i][j + 1] = s[i][j] + a[i][j]; } ll ans = 0; vector> ids(3); rep(i, 3) { ids[i].eb(0); rep(j, N[i]) { if (j == N[i] - 1 || a[i][j] > a[i][j + 1]) ids[i].eb(j + 1); } } auto binsearch = [&](int i, int j) { ll b = s[1][j]; int ok = sz(ids[2]) - 1, ng = -1; while (ok - ng > 1) { int mid = (ok + ng) / 2; if (b + a[2][ids[2][mid]] * i < 0) { ok = mid; } else { ng = mid; } } return ok; }; auto get = [&](int i, int j, int k){ i = ids[0][i]; j = ids[1][j]; k = ids[2][k]; return s[0][i] * j + s[1][j] * k + s[2][k] * i; }; rep(i, sz(ids[0])) rep(j, sz(ids[1])) { int k = binsearch(i, j); chmax(ans, get(i, j, k)); } cout << ans << '\n'; } int main() { int T = 1; // cin >> T; while (T--) solve(); }