Time limit: 1.00 s Memory limit: 512 MB
You are given an array of
Input
The first input line has two integers
The second line has n integers
Output
Print three integers: the positions of the values. If there are several solutions, you may print any of them. If there are no solutions, print IMPOSSIBLE
.
Constraints
$1 \le n \le 5000$ $1 \le x,a_i \le 10^9$
Example
Input:
4 8
2 7 5 1
Output:
1 3 4