After a scandal in which match-making algorithms were dependent on the two individual's names, he is trying to recover.

's clients discovered that hissays:

Love is dependent on the individual

, and . As is busy dealing with unhappy clients, he has no time to create a program to demonstrate this. Surely, he has called upon your help!

demonstrates this by using a love triangle consisting of 3 people,You can read about here. In short, each person's name is applied to a non-random, mathematical function which returns a value . The compatibility of two people are the sum of the two results from the function. Thus, the compatibility between two people is .

's love match algorithmGiven 3 integers, three compatibilities between the three people (, and ), find the maximum compatibility that , and can have with anyone.

#### Input Specification

3 space separated integers: the compatibilities explained above. The numbers are in the range . It is guaranteed that the 3 compatibilities are possible.

#### Output Specification

3 space separated integers denoting the maximum compatibility of , and respectively. The numbers should be in the range .

#### Sample Input

```
20
15
15
```

#### Sample Output

```
20
20
15
```

## Comments

For anyone having trouble interpreting this problem statement, anyone refers to a person with a value from 0 to 10 (instead of just A, B, and C as their matches).