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:
from sys import stdin, stdout
from math import *
from heapq import *
from collections import *


def test(x1,x2,x3,sm):
    c=x2+x3-sm
    if (c>0):
        a=x2-c
        b=x3-c
        if ((a>0) and (b>0)):
            if (x1==(b+a)):
                return True,a,b,c 
    return False,0,0,0

def main():
    x=[int(x) for x in stdin.readline().split()]    
    sm=max(x)
    x.sort()
    x=x[:3]
    # print(x)
    permutations=[
        [0,1,2],
        [0,2,1],
        [1,0,2],
        [1,2,0],
        [2,0,1],
        [2,1,0]
    ]
    for permu in permutations:
        x1,x2,x3=x[permu[0]],x[permu[1]],x[permu[2]]
        d,a,b,c=test(x1,x2,x3,sm)
        if (d==True):
            stdout.write("%d %d %d" %(a,b,c))
            return 0
    return 0

if __name__ == "__main__":
    main()