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.BufferedReader; 
import java.io.IOException; 
import java.io.InputStreamReader; 
import java.io.BufferedWriter;
import java.io.OutputStreamWriter;
import java.util.*; 

public class Main { 
	static class FastReader { 
		BufferedReader br; 
		StringTokenizer st; 

		public FastReader() { 
			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; 
		} 
	} 
	public ArrayList<Integer> adj = new ArrayList<>();

	public static Main [] g;
	public static int [][] e;
	public static int [] color;
	public static boolean flag;

	public static void dfs(int a, int c){
		Main.color[a] = c;
		Main A = Main.g[a];
		for(int b: A.adj){
			if(color[b] == -1){
				Main.dfs(b, c ^ 1);
			}else{
				if(color[b] == c){
					Main.flag = false;
				}
			}
		}
	}
	public static void main(String[] args) { 
		FastReader in=new FastReader(); 
		long [] list = new long [4];
		list[0] = in.nextLong();
		list[1] = in.nextLong();
		list[2] = in.nextLong();
		list[3] = in.nextLong();
		long max = Long.max(list[0], list[1]);
		max = Long.max(max, list[2]);
		max = Long.max(max, list[3]);
		

		try{
			BufferedWriter log = new BufferedWriter(new OutputStreamWriter(System.out));
			for(int i = 3; i>=0; i--){
			    list[i] = max - list[i];
			    if(list[i] != 0){
			        log.write(list[i] + " ");
			    }
			}
			log.flush();
			log.close();
		}catch(IOException e){

		}
	} 
}