#if __INCLUDE_LEVEL__ == 0 #include __BASE_FILE__ namespace { constexpr int L = 3000; void solve() { array n; cin >> n; vector c(3, vector(L * 2 + 1)); for (int t : rep(3)) { for (int _ = n[t]; _--;) { int a; cin >> a; ++c[t][L + a]; } } vector s(3, vector>(L * 2 + 2)); for (int t : rep(3)) { for (int i : per(L * 2 + 1)) { s[t][i] = s[t][i + 1]; s[t][i].first += c[t][i]; s[t][i].second += (i - L) * c[t][i]; } } int64_t ans = 0; for (int i : rep(L * 2 + 1)) { if (s[0][i].first == 0) { continue; } for (int j : rep(L * 2 + 1)) { for (int z : rep1(-1, 1)) { auto x = clamp(s[1][j].second / s[0][i].first + z, -L, L); int64_t cur = 0; cur += s[0][i].second * s[1][j].first; cur += s[1][j].second * s[2][L - x].first; cur += s[2][L - x].second * s[0][i].first; chmax(ans, cur); } } } for (int i : rep(L * 2 + 1)) { for (int j : rep(L * 2 + 1)) { chmax(ans, s[1][i].second * s[2][j].first + s[2][j].second * s[1][i].first); } } print(ans); } } // namespace int main() { ios::sync_with_stdio(false); cin.tie(nullptr); solve(); } #else // __INCLUDE_LEVEL__ #include using namespace std; template bool chmin(T& x, U&& y) { return y < x && (x = forward(y), true); } template bool chmax(T& x, U&& y) { return x < y && (x = forward(y), true); } namespace std { template istream& operator>>(istream& is, pair& p) { return is >> p.first >> p.second; } template istream& operator>>(istream& is, tuple& t) { return apply([&is](auto&... xs) -> istream& { return (is >> ... >> xs); }, t); } template istream& operator>>(istream& is, tuple&& t) { return is >> t; } template >* = nullptr> auto operator>>(istream& is, R&& r) -> decltype(is >> *begin(r)) { for (auto&& e : r) { is >> e; } return is; } template ostream& operator<<(ostream& os, const pair& p) { return os << p.first << ' ' << p.second; } template ostream& operator<<(ostream& os, const tuple& t) { auto f = [&os](const auto&... xs) -> ostream& { [[maybe_unused]] auto sep = ""; ((os << exchange(sep, " ") << xs), ...); return os; }; return apply(f, t); } template >* = nullptr> auto operator<<(ostream& os, R&& r) -> decltype(os << *begin(r)) { auto sep = ""; for (auto&& e : r) { os << exchange(sep, " ") << e; } return os; } } // namespace std template void print(Ts&&... xs) { cout << tie(xs...) << '\n'; } inline auto rep(int l, int r) { return views::iota(min(l, r), r); } inline auto rep(int n) { return rep(0, n); } inline auto rep1(int l, int r) { return rep(l, r + 1); } inline auto rep1(int n) { return rep(1, n + 1); } inline auto per(int l, int r) { return rep(l, r) | views::reverse; } inline auto per(int n) { return per(0, n); } inline auto per1(int l, int r) { return per(l, r + 1); } inline auto per1(int n) { return per(1, n + 1); } inline auto len = ranges::ssize; #endif // __INCLUDE_LEVEL__