A. Restoring Three Numbers

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 x1,x2,x3,x4

(2≤xi≤109) — numbers written on a board in random order. It is guaranteed that the answer exists for the given number x1,x2,x3,x4

.

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

Copy

3 6 5 4

Output

Copy

2 1 3

Input

Copy

40 40 40 60

Output

Copy

20 20 20

Input

Copy

201 101 101 200

Output

Copy

1 100 100

ac代码

#include<stdio.h>
#include<algorithm>
#include<cstring>
using namespace std;
#define ll long long
int main()
{
    ll x,y,z,t,a,b,c,a1[10]={0};
    while(scanf("%lld %lld %lld %lld",&a1[1],&a1[2],&a1[3],&a1[4])!=EOF)
    {
        sort(a1+1,a1+5);
        t=a1[4];
        b=(a1[1]-a1[2]+a1[3])/2;
        a=a1[1]-b;
        c=a1[3]-b;
        printf("%lld %lld %lld\n",a,b,c);

    }
}