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:
//1154A
//RestoringNumbers

import java.util.*;

public class RestoringNumber
{
    public static boolean isOk(int x, int y, int z, int abc)
    {
        int b = (z - y + x) / 2;
        int a = x - b;
        int c = y - x + b;

        if(a >= 0 && b >= 0 && c >= 0 && a + b + c == abc)
        {
            System.out.println(a + " " + b + " " + c);
            return true;
        }
        return false;
    }

    public static void main(String[] args) 
    {
        Scanner sc = new Scanner(System.in);
        int x = sc.nextInt();
        int y = sc.nextInt();
        int z = sc.nextInt();
        int k = sc.nextInt();
        
        int abc = Math.max(Math.max(x, y), Math.max(z, k));
        int[] arr;

        if(x == abc)
            arr = new int[]{y, z, k};
        else if(y == abc)
            arr = new int[]{x, z, k};
        else if(z == abc)
            arr = new int[]{x, y, k};
        else
            arr = new int[]{x, y, z};

        if(isOk(arr[0], arr[1], arr[2], abc));
        else if(isOk(arr[0], arr[2], arr[1], abc));
        else if(isOk(arr[1], arr[0], arr[2], abc));
        else if(isOk(arr[1], arr[2], arr[0], abc));
        else if(isOk(arr[2], arr[0], arr[1], abc));
        else if(isOk(arr[2], arr[1], arr[0], abc));
    }
}