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.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedHashMap;
import java.util.LinkedHashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeMap;




public class Main {
	
	static class TreeNode{
		int val;
		TreeNode left;
		TreeNode right;
		public TreeNode(int val) {
			this.val=val;
		}
	}
	
	static int gcd(int m,int n) {
		int c;
		while(n>0) {
			c=m%n;
			m=n;
			n=c;
		}
		return m;
	}
	
	public static int fun(int N,int[] rel) {
		Set<Integer> set=new HashSet<>();
		int cnt=0;
		while(true) {
			String s=String.valueOf(N);
			int sum=0;
			for(int i=0;i<s.length();i++) {
				int t=Integer.parseInt(s.charAt(i)+"");
				sum+=t*t;
			}
			if(sum==1)return cnt+1;
			if(set.contains(sum))return -1;
			rel[sum]=1;
			set.add(sum);
			N=sum;
			cnt++;
		}
	}
	
	public static boolean isPrime(int N) {
		for(int i=2;i<=Math.sqrt(N);i++) {
			if(N%i==0)return false;
		}
		return true;
	}
	
	static TreeMap<Integer,Integer> map=new TreeMap<>();
    public static void main(String[] args) {
    	Scanner sc=new Scanner(System.in);
    	long a=sc.nextLong();
    	long b=sc.nextLong();
    	long c=sc.nextLong();
    	long d=sc.nextLong();
    	
    	long t=(a+b+c+d)/3;
 
			if(a==t) {
				b=t-b;
				c=t-c;
				d=t-d;
				System.out.println(b+" "+c+" "+d);
			}else if(b==t) {
				a=t-a;
				c=t-c;
				d=t-d;
				System.out.println(a+" "+c+" "+d);
			}else if(c==t) {
				b=t-b;
				a=t-a;
				d=t-d;
				System.out.println(b+" "+a+" "+d);
			}else{
				a=t-a;
				b=t-b;
				c=t-c;
				System.out.println(a+" "+b+" "+c);
			}

    	
    }
}