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.*;

public class CodeForces
{
	public static void main(String args[])
	{
		Scanner input = new Scanner(System.in);
		long x1 = input.nextLong();
		long x2 = input.nextLong();
		long x3 = input.nextLong();
		long x4 = input.nextLong();
		long sum = (x1 + x2 + x3 + x4) / 3;
		long p1 = sum - x1;
		long p2 = sum - x2;
		long p3 = sum - x3;
		long p4 = sum - x4;
		if (p1 != 0)
		{
			System.out.print(p1 + " ");
		}
		if (p2 != 0)
		{
			System.out.print(p2 + " ");
		}
		if (p3 != 0)
		{
			System.out.print(p3 + " ");
		}
		if (p4 != 0)
		{
			System.out.print(p4 + " ");
		}
		System.out.println();
	}
}