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:
l = [*map(int,input().split())]
a = b = c = 0
# a+b=a[0]
# a+c=a[1]

# -a-b=-a[0]
#  a+c=a[1]
# -b+c=a[1]-a[0]   1
#  b+c=a[2]
#  2c=a[2]+(a[1]-a[0])
l.sort()
c = l[3]-l[0]
b= l[2]-c
a = l[0]-b
h=[a,b,c]
h.sort()
'''
print(a,b,c)
if h[0]<0:
        h[2]-=abs(h[0])+1
        h[0]=1
if h[1]<0:
        h[2]-=abs(h[1])+1
        h[1]=1
print(*h)
'''
print(a,b,c)