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 sys
import os.path
import math
import heapq
from sys import stdin,stdout
from collections import*
from math import gcd,ceil,floor
mod = int(1e9+7)
##input=sys.stdin.readline

if os.path.exists('Updated prg/Input3d.txt'):
    sys.stdout=open("Updated prg/Output3d.txt","w")
    sys.stdin=open("Updated prg/Input3d.txt","r")
 
def sinp():return input()
def ninp():return int(sinp())
def mapinp():return map(int,sinp().split())
def linp():return list(mapinp())
def sl():return list(sinp())
def prnt(a):print(a)
def prntl(a):print(a,end=" ")
def power(n): return 1<<n

a,b,c,d=mapinp()
l1=[a,b,c,d]
m1=max(l1)
l1.remove(m1)
l2=[]
for i in l1:
    l2.append(m1-i)
print(*l2)