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;
public class MainActivity {
	public static void main(String[] args) {
		Scanner ss = new Scanner(System.in);
		String str = ss.nextLine();
		String[] subStr;
		String delimeter = " ";
		subStr = str.split(delimeter); 
		int d = 0, e = 0, g = 0, f = 0;
		int a = 0, b = 0, c = 0;
		
		d = Integer.parseInt(subStr[0]);
		e = Integer.parseInt(subStr[1]);
		g = Integer.parseInt(subStr[2]);
		f = Integer.parseInt(subStr[3]);
		
		if(f > d && f > e && f > g) {
			a = f - e; b = f - g; c = f - d;
		}
		if(g > d && g > e && g > f) {
			a = g - e; b = g - f; c = g - d;
		}
		if(e > d && e > g && e > f) {
			a = e - d; b = e - g; c = e - f; 
		}
		if(d > e && d > g && d > f) {
			a = d - e; b = d - g; c = d - f;
		}

		System.out.print(a + " " + b + " " + c);
	
		
		
	}
}