def ful():
    x = {a+ b + c - (f(a, b, c) + f(b, a, c) + f(c, a, b))}
    return sorted(x)
def f(x, y, z):
    return x - x.intersection(y) - x.intersection(z)
a = set(map(int, input().split()))
b = set(map(int, input().split()))
c = set(map(int, input().split()))
print(ful())