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.io.*;
import java.util.*;

public class Program {

    static List<Integer> inputs = new ArrayList<>();

    public static void main(String[] args){
        final MyScanner sc = new MyScanner();
        inputs.add(sc.nextInt());
        inputs.add(sc.nextInt());
        inputs.add(sc.nextInt());
        inputs.add(sc.nextInt());
        System.out.print(stringify(calculate()));
    }

    public static List<Integer> calculate(){
        final Integer sum = findLargest(inputs);
        List<Integer> result = new ArrayList<>();
        for (Integer value: inputs) {
            final int x = sum - value;
            if (x != 0){
                result.add(x);
            }
        }
        return result;
    }

    public static String stringify(List<Integer> values){
        return String.format("%d %d %d", values.get(0), values.get(1), values.get(2));
    }

    public static Integer findLargest(List<Integer> values){
        int max = values.get(0);
        for (int i = 0; i < values.size(); i++){
            if (max < values.get(i)){
                max = values.get(i);
            }
        }
        return max;
    }

    public static class MyScanner {
        BufferedReader br;
        StringTokenizer st;

        public MyScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine(){
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }

    }
}