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

Solution:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import static java.lang.Math.*;

public class RestoringThreeNumbers {

	public static void main(String[] args) throws IOException {

		int a,b,c,d;
		int [] arr=new int[4];
		int [] arr2=new int[4];
		
		
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		String str[]=br.readLine().split(" ");
		
		for(int i=0;i<str.length;i++)
		{
			arr[i]=Integer.parseInt(str[i]);
		}
		a=arr[0];
				b=arr[1];
				c=arr[2];
				d=arr[3];
		int x=max(a,b);
		int y=max(c,d);
		int z=max(x,y);
		
		for(int i=0;i<4;i++)
		{
		
			if(arr[i]!=z)
				arr2[i]=z-arr[i];
			
			else
				continue;
		}
		
		for(int i=0;i<4;i++) {
			if(arr2[i]==0)
				continue;
		System.out.print(arr2[i]+" ");
		}
	}

}