The closest in line with the given heights

Input

You will receive input from the standard input device. The first line contains the space-separated integers $n$ , $v a l_{1}$ val_1, and $v a l_{2}$ val_2. The second line contains the heights of all $n$ players, listed from left to right, also separated by spaces. The constraints are $30 \leq n \leq 40$ 30 \leq n \leq 40, and each player's height is between $170$ and $180$ cm inclusive.

Output

Your output should be the minimum distance $d_{min}$ d_{min} between players with heights $v a l_{1}$ val_1 and $v a l_{2}$ val_2, followed by the positions $k_{1 min}$ k_{1min} and $k_{2 min}$ k_{2min} of these players in the line, all separated by spaces. It is guaranteed that there are players with heights $v a l_{1}$ val_1 and $v a l_{2}$ val_2 in the line.

Examples

Example 1

Loading