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 change(a,b,c,m):

    if m==1:
        return a,b,c
    elif m==2:
        return a,c,b
    elif m==3:
        return b,a,c
    elif m==4:
        return b,c,a
    elif m==5:
        return c,a,b
    elif m==6:
        return c,b,a





arr = list(map(int,input().split()))
arr.sort()
a=arr[0]
b=arr[1]
c=arr[2]
d=arr[3]

m=1
while m!=6:
    p,q,r= change(a,b,c,m)
    x = ((p - r) + q) // 2
    y = ((p - q) + r) // 2
    z = ((r - p) + q) // 2

    print(x, y, z)
    break
    m=m+1