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.util.Scanner;
import java.util.Arrays;
public class restorethree {

	public static void main(String [] args) {
		Scanner s = new Scanner(System.in);
		String[] input = s.nextLine().split("\\s+");
		//i should have 4 things now
		//technically I can do everything I need with Integer.parseInt() now
		//but I will use a little more memory to make code easier to handle
		
		int[] process = new int[input.length];
		for (int i = 0; i < input.length; i++) {
			process[i] = Integer.parseInt(input[i]);
		}
		
		//Arrays.sort() which would take nlogn with a MergeSort algorithm
		//this is still 4*log(4) = 4*2 = 8 operations
		Arrays.sort(process);
		
		System.out.println((process[3] - process[0]) + " " + (process[3] - process[1]) +" "
			+ (process[3] - process[2]));
		
		s.close();
	}
}