Problem: Polycarp has guessed three positive integers a, b and c. He keeps these numbers in secret, but he writes down four numbers on a board in arbitrary order — their pairwise sums (three numbers) and sum of all three numbers (one number). So, there are four numbers on a board in random order: a+b, a+c, b+c and a+b+c.

You have to guess three numbers a, b and c using given numbers. Print three guessed integers in any order.

Pay attention that some given numbers a, b and c can be equal (it is also possible that a=b=c).

Input

The only line of the input contains four positive integers x_1, x_2, x_3, x_4 (2 ≤ x_i ≤ 10^9) — numbers written on a board in random order. It is guaranteed that the answer exists for the given number x_1, x_2, x_3, x_4.

Output

Print such positive integers a, b and c that four numbers written on a board are values a+b, a+c, b+c and a+b+c written in some order. Print a, b and c in any order. If there are several answers, you can print any. It is guaranteed that the answer exists.

Examples

Input


3 6 5 4


Output


2 1 3


Input


40 40 40 60


Output


20 20 20


Input


201 101 101 200


Output


1 100 100

Solution (in PYTHON3):

Solution:
def solve_equation(b1, b2, b3):
    x2 = (b1 - b2 + b3) / 2
    x3 = b3 - x2
    x1 = b2 - x3

    return int(x1), int(x2), int(x3)


if __name__ == '__main__':

    input_ = input().split()

    x1 = int(input_[0])
    x2 = int(input_[1])
    x3 = int(input_[2])
    x4 = int(input_[3])

    if x1 == (x2 + x3 + x4) / 2:
        tmp = solve_equation(x2, x3, x4)
        print(tmp[0], tmp[1], tmp[2])

    if x2 == (x1 + x3 + x4) / 2:
        tmp = solve_equation(x1, x3, x4)
        print(tmp[0], tmp[1], tmp[2])

    if x3 == (x1 + x2 + x4) / 2:
        tmp = solve_equation(x1, x2, x4)
        print(tmp[0], tmp[1], tmp[2])

    if x4 == (x1 + x2 + x3) / 2:
        tmp = solve_equation(x1, x2, x3)
        print(tmp[0], tmp[1], tmp[2])