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:
import os


def _f(x1, x2, x3, x4):
    x_arr = [x1, x2, x3, x4]
    x_arr.sort(reverse=True)
    c = x_arr[0] - x_arr[1]
    a = x_arr[2] - c
    b = x_arr[3] - c
    return a, b, c


def f(x1, x2, x3, x4):
    a, b, c = _f(x1, x2, x3, x4)
    return f"{a} {b} {c}"


if os.environ.get('DEBUG', False):
    print(f"{f(3, 6, 5, 4)} = 2 1 3")
    print(f"{f(40, 40, 40, 60)} = 20 20 20")
    print(f"{f(201, 101, 101, 200)} = 1 100 100")
else:
    x1, x2, x3, x4 = list(map(int, input().split()))
    print(f(x1, x2, x3, x4))