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:
a=input()
(a,b,c,d)=a.split()
a=int(a)
b=int(b)
c=int(c)
d=int(d)
if (a>b>=c>=d or a>b>=d>=c or a>c>=b>=d or a>c>=d>=b or a>d>=c>=b or a>d>=b>=c):
  e=a-b
  f=a-c
  g=a-d
  print(g,f,e)
elif (b>a>=c>=d or b>a>=d>=c or b>c>=a>=d or b>c>=d>=a or b>d>=c>=a or b>d>=a>=c):
  e=b-a
  f=b-c
  g=b-d
  print(g,f,e)
elif (c>a>=b>=d or c>a>=d>=b or c>b>=a>=d or c>b>=d>=a or c>d>=b>=a or c>d>=a>=b):
  e=c-a
  f=c-b
  g=c-d
  print(g,f,e)
else:
  e=d-a
  f=d-b
  g=d-c
  print(g,f,e)