CF1154A.Restoring Three Numbers

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$).

Polycarp 猜想了三个正整数 $a$、$b$ 和 $c$。他将这三个数保密，但将它们的两两之和（共三个数）以及三数之和（一个数）以任意顺序写在黑板上。因此，黑板上共有四个数，按随机顺序排列：$a+b$、$a+c$、$b+c$ 和 $a+b+c$。

你需要根据给定的这四个数，推断出原始的三个数 $a$、$b$ 和 $c$。请以任意顺序输出你猜测出的这三个整数。

注意：给定的数 $a$、$b$、$c$ 中可能存在相等的情况（包括 $a = b = c$ 的情形）。

The only line of the input contains four positive integers $x_1, x_2, x_3, x_4$ ($2 \le x_i \le 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$.

输入仅包含一行，其中有四个正整数 $x_1, x_2, x_3, x_4$（$2 \le x_i \le 10^9$），它们以任意顺序写在黑板上。保证对于给定的数 $x_1, x_2, x_3, x_4$，答案一定存在。

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.

输出满足条件的正整数 $a$、$b$ 和 $c$，使得黑板上所写的四个数恰好是 $a+b$、$a+c$、$b+c$ 和 $a+b+c$（以某种顺序排列）。以任意顺序输出 $a$、$b$ 和 $c$。若存在多个解，输出任意一个即可。题目保证解一定存在。