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.*;
import java.io.*;
public class Main {
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(br.readLine());
		int[] nums = new int[4];
		int abc = -1;
		for (int i = 0; i < 4; ++i) {
			nums[i] = Integer.parseInt(st.nextToken());
			if (nums[i] > abc) abc = nums[i];
		}
		int[] pairs = new int[3];
		int index = 0;
		for (int i = 0; i < 4; ++i) {
			if (nums[i] != abc) {
				pairs[index ++] = nums[i];
			}
		}
		int a = (pairs[0] + pairs[1] - pairs[2]) / 2;
		int b = pairs[0] - a;
		int c = abc - a - b;
		System.out.println("" + a + " " + b + " " + c);
	}
}