B. Lunch!
time limit per test
1 second
memory limit per test
1024 megabytes
input
standard input
output
standard output

When choosing lunch, sandwiches are a good option.

For a sequence of length $$$3$$$ denoted as $$$a_1, a_2, a_3$$$, we call this sequence a "sandwich sequence" if $$$a_1 \gt a_2$$$ and $$$a_2 \lt a_3$$$.

Given a sequence of length $$$3$$$ represented as $$$a_1, a_2, a_3$$$, you can perform the following operation:

  • Choose two different integers $$$i, j$$$ and swap $$$a_i$$$ with $$$a_j$$$.

If it is possible to make $$$a_1, a_2, a_3$$$ into a "sandwich sequence" within a finite number of operations, please output the resulting sequence. If there are multiple valid sequences, output any one of them; if such a sequence does not exist, output -1.

Input

Input a line with three integers $$$a_1, a_2, a_3 (1 \leq a_1, a_2, a_3 \leq 10)$$$, representing the given sequence.

Output

If a valid sequence exists, output a line with $$$3$$$ integers representing the resulting sequence; if such a sequence does not exist, output a line with a single integer -1.

Examples
Input
3 1 6
Output
3 1 6
Input
1 2 3
Output
2 1 3
Input
1 1 1
Output
-1