#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

using namespace std;

typedef long long ll;
#define all(x) begin(x), end(x)
constexpr int INF = (1 << 30) - 1;
constexpr long long IINF = (1LL << 60) - 1;
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

template <class T> istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) is >> x;
    return is;
}

template <class T> ostream& operator<<(ostream& os, const vector<T>& v) {
    auto sep = "";
    for (const auto& x : v) os << exchange(sep, " ") << x;
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = forward<U>(y), true); }

template <class T> void mkuni(vector<T>& v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <class T> int lwb(const vector<T>& v, const T& x) { return lower_bound(begin(v), end(v), x) - begin(v); }

const int MAX = 3010;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    vector<int> N(3);
    vector<vector<int>> A(3);
    for (int i = 0; i < 3; i++) cin >> N[i];
    for (int i = 0; i < 3; i++) {
        A[i].resize(N[i]);
        for (int j = 0; j < N[i]; j++) cin >> A[i][j];
    }

    vector cnt(3, vector<int>(2 * MAX, 0)), sum(3, vector<int>(2 * MAX, 0));
    for (int i = 0; i < 3; i++) {
        for (int& x : A[i]) {
            cnt[i][x + MAX]++;
            sum[i][x + MAX] += x;
        }
        for (int j = 2 * MAX - 1; j > 0; j--) {
            sum[i][j - 1] += sum[i][j];
            cnt[i][j - 1] += cnt[i][j];
        }
    }
    ll ans = 0;
    for (int i = 0; i < 2 * MAX; i++) {
        for (int j = 0; j < 2 * MAX; j++) {
            ll x = 1LL * sum[0][i] * cnt[1][j];
            int a = cnt[0][i], b = sum[1][j];
            int c = (a != 0 ? -b / a : -MAX);
            c = min(2 * MAX - 1, max(c + MAX, 0));
            x += 1LL * b * cnt[2][c] + 1LL * sum[2][c] * a;
            ans = max(ans, x);
        }
    }
    cout << ans << '\n';
    return 0;
}