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,b,c,d=map(int,input().split())
ma=a
poz=1
if ma < b :
    ma=b
    poz=2
if ma < c:
    ma=c
    poz=3
if ma< d :
    ma=d
    poz=4
if a!=ma or (a==ma and poz!=1) :
    x=ma-a
    poz_2=1
else :
    if b!=ma or (b==ma and poz!=2) :
        x=ma-b
        poz_2=2
    else :
        if c!=ma or (c==ma and poz!=3) :
            x=ma-c
            poz_2=3
        else :
            if d!=ma or (d==ma and poz!=4) :
                x=ma-d
                poz_2=4
if poz!=1 and poz_2!=1:
    y=a-x
else:
    if poz!=2 and poz_2!=2:
        y=b-x
    else:
        if poz!=3 and poz_2!=3:
            y=c-x
        else:
            if poz!=4 and poz_2!=4:
                y=d-x
z=ma-x-y
print(x,y,z)