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 func1(n1, n2, n3):
    r = int((n1 + n2 - n3) / 2)
    return r, n1 - r, n2 - r


def check(n1n2n3, r):
    if n1n2n3 == sum(r) : 
        return True
    else:
        return False
    
if __name__ == '__main__':
    input_numbers = input()
    input_numbers = list(map(lambda y:int(y), input_numbers.split(' ')), )
    n1n2n3 = int(input_numbers.pop(input_numbers.index(max(input_numbers))))
    possible_r = []
    for i in (0, 1, 2):
        for j in (0, 1, 2):
            for k in (0, 1, 2):
                if i!=j and j != k :
                    possible_r.append(func1(input_numbers[i], input_numbers[j], input_numbers[k]))

    for r in possible_r:
        if n1n2n3==sum(r):
            a, b, c = r
            print(a, b, c)
            break