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

import javax.lang.model.util.ElementScanner6;
import javax.swing.text.DefaultStyledDocument.ElementSpec;

import java.io.*;

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;
		}
	}
  static HashSet<Integer>H=new HashSet<>(); static int count=0;
 


	public static void main(String[] args) throws FileNotFoundException {
  FastReader scan=new FastReader();
 int a=scan.nextInt();
 int b=scan.nextInt();
 int c=scan.nextInt();
 int d=scan.nextInt();
ArrayList<Integer>A=new ArrayList<Integer>();
A.add(a);
A.add(b);
A.add(c);
A.add(d);
Collections.sort(A);
int  max=A.get(A.size()-1);
int x=max-A.get(0);
int y=A.get(1)-x;
int z=A.get(2)-x;
System.out.println(x+" "+y+" "+z);


	
  
	

   

	
}
	   
   
  
















	
  /*int t=scan.nextInt();
  while(t-->0){
	  long n=scan.nextLong();
	  long k=scan.nextLong();
	  long a[]=new long[(int)n];
	  for(long i=0;i<n;++i){
		  a[(int)i]=scan.nextInt();
	  }
	  ArrayList<Long>left=new ArrayList<>();
	  ArrayList<Long>Right=new ArrayList<>();
	  for(int i=0;i<a.length;++i){
		   long sum=k-a[i];
		   if(!left.contains(sum)){
			   left.add(a[i]);
		   }
		   else
		   if(!Right.contains(sum)){
			   Right.add(a[i]);
		   }
		   else{
			   //Count the number having less number of than sum
				long check1=check(left,sum);
				long check2=check(Right,sum);
				if(check1>check2){
                   Right.add(a[i]);
				}
				else{
					left.add(a[i]);
				}
		   }
	  }
	 
	  for(int i=0;i<a.length;++i){
		  if(Right.contains(a[i])){
			  System.out.print(0+" ");
			  Right.remove(Right.lastIndexOf(a[i]));
			  
		  }
		else
		if(left.contains(a[i])){
			System.out.print(1+" ");
			left.remove(left.lastIndexOf(a[i]));
		
		}
		  
	  }
	  System.out.println();


  }
 System.out.println();

 */

 

 

	
	static long check(ArrayList<Long>A,long sum){
		Iterator it=A.iterator();
		long count=0;
		while(it.hasNext()){
				  long temp=(long)it.next();
				  if(temp==sum){
					  ++count;
				  }
		}
		return count;
	}
	















		  }