Codeforces Round #552 (Div. 3) A题

题目链接 http://codeforces.com/contest/1154/problem/A

题目

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 aa, bb and cc. 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+ba+b, a+ca+c, b+cb+c and a+b+ca+b+c.

You have to guess three numbers aa, bb and cc using given numbers. Print three guessed integers in any order.

Pay attention that some given numbers aa, bb and cc can be equal (it is also possible that a=b=ca=b=c).

Input

The only line of the input contains four positive integers x1,x2,x3,x4x1,x2,x3,x4 (2≤xi≤1092≤xi≤109) — numbers written on a board in random order. It is guaranteed that the answer exists for the given number x1,x2,x3,x4x1,x2,x3,x4.

Output

Print such positive integers aa, bb and cc that four numbers written on a board are values a+ba+b, a+ca+c, b+cb+c and a+b+ca+b+c written in some order. Print aa, bb and cc 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
#include
using namespace std;
int main()
{
    int s[6];
    while(scanf("%d%d%d%d",&s[0],&s[1],&s[2],&s[3])==4){
        sort(s,s+4);
        cout<