Problem Description

In the parallel world of Luogu, there are three cities A, B, and C, which form the Luogu Delta.

There is a bidirectional road between each pair of cities. That is, there are a total of three roads: one between city A and city B, one between city A and city C, and one between city B and city C.

Due to different congestion levels on each road, the time required to travel on a road also varies. For each road, the congestion level is the same in both directions (i.e., the time required to travel from city A to city B is the same as from city B to city A).

It takes $x$ minutes to travel between city A and city B, $y$ minutes between city B and city C, and $z$ minutes between city C and city A.

Due to business needs, the Luogu site administrator needs to frequently travel between the three cities. If he can know the shortest travel time between any two cities, he can greatly improve his work efficiency.

Therefore, he now wants to know: the minimum time (in minutes) required to travel from city A to city B, from city B to city C, and from city A to city C. He thinks this problem is too difficult, so he has handed it over to you, the clever one.

Input Format

The input consists of a single line with three integers, representing $x, y, z$ respectively.

Output Format

The output consists of three lines:
- The first line is the minimum time required to travel from city A to city B.
- The second line is the minimum time required to travel from city B to city C.
- The third line is the minimum time required to travel from city A to city C.

Sample Input and Output

Sample Input #1

1 2 5

Sample Output #1

1
2
3

Sample Input #2

3 3 3

Sample Output #2

3
3
3

Notes

Sample 1 Explanation

It takes $1$ minute to travel from city A to city B, and $2$ minutes from city B to city C.
To travel from city A to city C, one can first go from city A to city B, then from city B to city C, which takes $1 + 2 = 3$ minutes.

Data Size and Constraints

• For $20\%$ of the data, $x = y = z$;
• For another $20\%$ of the data, $x + y \geq z$, $x + z \geq y$, $y + z \geq x$;
• For $100\%$ of the data, $1 \leq x, y, z \leq 10^9$.

见题面 Input 部分

见题面 Output 部分