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:
"""1154A - Restoring Three Numbers
https://codeforces.com/problemset/problem/1154/A In this problem, notice that a + b + c is going to be the maximum of
the given 4 numbers.  For each of the other 3 numbers, subtracting it from the maximum value gives you one of the
desired a, b, or c.  The answer cares not about the order of a, b, and c, all of which are positive integers (and (a + b
+ c) - (a + b + c) = 0, so that's easy to identify).
"""
# Problem #    : 1154A
# Created on   : 2019.06.09

arr = [int(val) for val in input().split()]
hi = max(arr)
for x in arr:
    if hi - x > 0:
        print(hi - x, end=' ')