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 Main {


    private static Scanner scanner = new Scanner(System.in);

    public static void main(String[] args) {
        solveA();
        // solveC();

        // solveE();



    }


    private static void solveA() {
        int[] all = new int[4];

        int maxInd = 0;
        for (int i = 0; i < 4; i++) {
            all[i] = nI();
            if (all[i] > all[maxInd]) {
                maxInd = i;
            }
        }

        StringBuilder s = new StringBuilder();
        for (int i = 0; i < 4; i++) {
            if (i != maxInd) {
               s.append(all[maxInd] - all[i] + " ");
            }
        }
        s.deleteCharAt(s.length() - 1);
        System.out.println(s.toString());
    }

    private static void solveB() {
        int n = nI();
        int[] nums = new int[n];
        int res = 0;

        for (int i = 0; i < n; i++) {
            nums[i] = nI();
        }

        if (n == 1) {
            res = 0;
        } else if (n == 2) {
            res = Math.abs(nums[0] - nums[1] ) % 2 == 0 ? Math.abs(nums[0] - nums[1]) / 2 : Math.abs(nums[0] - nums[1]);
        } else {
            int diff = Integer.MIN_VALUE;
            for (int i = 0; i < n - 1; i++) {
                if (Math.abs(nums[i] - nums[i + 1]) != 0) {
                    if (diff == Integer.MIN_VALUE) {
                        diff = Math.abs(nums[i] - nums[i + 1]);
                        res = diff;
                    } else {
                        if (diff != Math.abs(nums[i] - nums[i + 1])) {
                            res = -1;
                            break;
                        }
                    }
                }
            }
        }
        System.out.println(res);
    }

    private static void solveC() {


    }

    private static void solveE() {
        int n = nI();
        int[] nums = new int[n];
        int ind1 = 0;
        int ind2 = 0;
        
        long least = Long.MAX_VALUE;
        for (int i = 0; i < n; i++) {
            nums[i] = nI();
        }

        for (int i = 0; i < n - 1; i++) {
            for (int j = i + 1; j < n; j++) {
                long temp = nums[i] / gcd(nums[i], nums[j]) * nums[j];
                if (temp < least) {
                    least = temp;
                    ind1 = i;
                    ind2 = j;
                }
            }
        }
        System.out.println((ind1 + 1) + " " + (ind2 + 1) );
    }

    private static int gcd(int a, int b) {
        while (b != 0) {
            int t = a;
            a = b;
            b = t % b;
        }
        return a;
    }






    private static int nI() {
        return scanner.nextInt();
    }

}