def ful():
    x = f(a, b, c)
    if len(x) == 0:
        x = f(b, a, c)
        if len(x) == 0:
            x = 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())