#include <bits/stdc++.h>
using namespace std;
template <typename T, size_t N>
int SIZE(const T (&t)[N]) {
  return N;
}
template <typename T>
int SIZE(const T &t) {
  return t.size();
}
string to_string(const string s, int x1 = 0, int x2 = 1e9) {
  return '"' + ((x1 < s.size()) ? s.substr(x1, x2 - x1 + 1) : "") + '"';
}
string to_string(const char *s) { return to_string((string)s); }
string to_string(const bool b) { return (b ? "true" : "false"); }
string to_string(const char c) { return string({c}); }
template <size_t N>
string to_string(const bitset<N> &b, int x1 = 0, int x2 = 1e9) {
  string t = "";
  for (int __iii__ = min(x1, SIZE(b)), __jjj__ = min(x2, SIZE(b) - 1);
       __iii__ <= __jjj__; ++__iii__) {
    t += b[__iii__] + '0';
  }
  return '"' + t + '"';
}
template <typename A, typename... C>
string to_string(const A(&v), int x1 = 0, int x2 = 1e9, C... coords);
int l_v_l_v_l = 0, t_a_b_s = 0;
template <typename A, typename B>
string to_string(const pair<A, B> &p) {
  l_v_l_v_l++;
  string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
  l_v_l_v_l--;
  return res;
}
template <typename A, typename... C>
string to_string(const A(&v), int x1, int x2, C... coords) {
  int rnk = rank<A>::value;
  string tab(t_a_b_s, ' ');
  string res = "";
  bool first = true;
  if (l_v_l_v_l == 0) res += '\n';
  res += tab + "[";
  x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v));
  auto l = begin(v);
  advance(l, x1);
  auto r = l;
  advance(r, (x2 - x1) + (x2 < SIZE(v)));
  for (auto e = l; e != r; e = next(e)) {
    if (!first) {
      res += ", ";
    }
    first = false;
    l_v_l_v_l++;
    if (e != l) {
      if (rnk > 1) {
        res += '\n';
        t_a_b_s = l_v_l_v_l;
      };
    } else {
      t_a_b_s = 0;
    }
    res += to_string(*e, coords...);
    l_v_l_v_l--;
  }
  res += "]";
  if (l_v_l_v_l == 0) res += '\n';
  return res;
}
void dbgm() { ; }
template <typename Heads, typename... Tails>
void dbgm(Heads H, Tails... T) {
  cout << to_string(H) << " | ";
  dbgm(T...);
}
void fast() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
}
long long dp[202][202][202];
long long red[201];
long long green[201];
long long blue[201];
long long no_r, no_g, no_b;
void solve() {
  cin >> no_r >> no_g >> no_b;
  for (long long i = 0; i < no_r; i++) {
    cin >> red[i];
  };
  for (long long i = 0; i < no_g; i++) {
    cin >> green[i];
  };
  for (long long i = 0; i < no_b; i++) {
    cin >> blue[i];
  };
  sort(red, red + no_r);
  reverse(red, red + no_r);
  sort(green, green + no_g);
  reverse(green, green + no_g);
  sort(blue, blue + no_b);
  reverse(blue, blue + no_b);
  memset(dp, 0, sizeof(dp));
  for (long long r = 0; r <= no_r; r++) {
    for (long long g = 0; g <= no_g; g++) {
      for (long long b = 0; b <= no_b; b++) {
        if (r && g)
          dp[r][g][b] =
              max(dp[r][g][b], dp[r - 1][g - 1][b] + red[r - 1] * green[g - 1]);
        if (g && b)
          dp[r][g][b] = max(dp[r][g][b],
                            dp[r][g - 1][b - 1] + green[g - 1] * blue[b - 1]);
        if (r && b)
          dp[r][g][b] =
              max(dp[r][g][b], dp[r - 1][g][b - 1] + red[r - 1] * blue[b - 1]);
        if (r) dp[r][g][b] = max(dp[r][g][b], dp[r - 1][g][b]);
        if (g) dp[r][g][b] = max(dp[r][g][b], dp[r][g - 1][b]);
        if (b) dp[r][g][b] = max(dp[r][g][b], dp[r][g][b - 1]);
      }
    }
  }
  cout << dp[no_r][no_g][no_b] << '\n';
}
int main() {
  fast();
  int t = 1;
  while (t--) {
    solve();
  }
}
