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 PYTHON):

Solution:
#####################################   
import atexit, io, sys, collections, math, heapq, fractions, bisect,copy
buffer = io.BytesIO() 
sys.stdout = buffer
@atexit.register 
def write(): sys.__stdout__.write(buffer.getvalue())   
class SGT(object):

	def __init__(self, a):
		self.a = a[::]
		self.t = self.build(self.a)

	def build(self, a):
		t = [0 for _ in range(len(a)<< 1)]
		for i in range(len(a)): t[i+len(a)] = a[i]
		for i in range(len(a)-1, 0, -1):t[i] += t[2*i] + t[2*i +1]
		return t

	## a[i] = val
	def update(self,i,val):
		delta = val - self.a[i]
		self.a[i] += delta 
		i += len(self.a)
		while(i > 0):
			self.t[i] += delta
			i >>= 1
	## queries l and r included
	def query(self,l,r):
		l += len(self.t) // 2
		r += len(self.t) // 2
		ans = 0
		while(l <= r):
			if l % 2: 
				ans += self.t[l]
				l +=1
			if r % 2 == 0: 
				ans += self.t[r]
				r -=1
			l >>= 1
			r >>= 1
		return ans
####################################

ais = map(int, raw_input().split())
ais.sort()
s = ais[-1]
a,b,c = ais[:3]
a *=-1
a += s
c *=-1
c += s
b *=-1
b += s

print a,b,c