Na, Nb, Nc = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))

geta = 3005
def f(X):
    Dn, Ds = [0] * (2 * geta), [0] * (2 * geta)
    Xn, Xs = [0] * (2 * geta), [0] * (2 * geta)
    for x in X:
        Dn[x + geta] += 1
        Ds[x + geta] += x
    for i in range(2 * geta-1):
        Xn[i + 1] = Xn[i] + Dn[i]
        Xs[i + 1] = Xs[i] + Ds[i]
    return Xn, Xs    

An, As = f(A)
Bn, Bs = f(B)
Cn, Cs = f(C)
ans = 0
for b in range(2 * geta):
    bn = Bn[-1] - Bn[b]
    bs = Bs[-1] - Bs[b]
    for c in range(2 * geta):
        cn = Cn[-1] - Cn[c]
        cs = Cs[-1] - Cs[c]
        if bn == 0:
            ans = max(ans, cs * Na)
        else:
            v = (-cs)//bn + 1
            if v >= geta:
                n = s = 0
            else:
                n = An[-1] - An[max(0, v + geta)]
                s = As[-1] - As[max(0, v + geta)]
            ans = max(ans, s * bn + bs * cn + cs * n)
            
print(ans)