import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


// floor(a / b)
Int divFloor(Int)(Int a, Int b) {
  return a / b - (((a ^ b) < 0 && a % b != 0) ? 1 : 0);
}

// ceil(a / b)
Int divCeil(Int)(Int a, Int b) {
  return a / b + (((a ^ b) > 0 && a % b != 0) ? 1 : 0);
}


void main() {
  try {
    for (; ; ) {
      auto N = new int[3];
      foreach (h; 0 .. 3) {
        N[h] = readInt;
      }
      auto A = new long[][3];
      foreach (h; 0 .. 3) {
        A[h] = new long[N[h]];
        foreach (i; 0 .. N[h]) {
          A[h][i] = readLong;
        }
        A[h].sort!"a > b";
      }
      
      auto ASum = new long[][3];
      auto kss = new int[][3];
      foreach (h; 0 .. 3) {
        ASum[h] = new long[N[h] + 1];
        foreach (i; 0 .. N[h]) {
          ASum[h][i + 1] = ASum[h][i] + A[h][i];
        }
        kss[h] ~= 0;
        foreach (k; 1 .. N[h]) if (A[h][k - 1] != A[h][k]) {
          kss[h] ~= k;
        }
        kss[h] ~= N[h];
// kss[h]=iota(N[h]+1).array;
      }
      debug {
        writeln("A = ", A);
        writeln("ASum = ", ASum);
        writeln("kss = ", kss);
      }
      
      long ans = long.min;
      foreach (k1; kss[1]) foreach (k2; kss[2]) {
        const s1 = ASum[1][k1];
        const s2 = ASum[2][k2];
        // k1 a - s2 >= 0
        const k0 = A[0].binarySearch!(a => (k1 * a + s2 < 0));
        const s0 = ASum[0][k0];
        long score;
        score += s0 * k1;
        score += s1 * k2;
        score += s2 * k0;
        chmax(ans, score);
        debug {
          if (N.sum <= 12) {
            writeln([k0, k1, k2], " ", [s0, s1, s2], " ", score);
          }
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}