Attacking Pairs

Underwater world is in hard times, and a war has broken out. Aquaman gathered his army of $n$ different creatures, lined them up, and numbered them from $1$ to $n$. The $i$-th creature has strength $a_i$.

Aquaman learned the following fighting technique from his mother: pairs of creatures are sent into battle, strike a precise blow on the enemy army, and then immediately return to their places in the line. Not every pair can be sent, though. Only pairs of creatures $1 \le i, j \le n$ that satisfy

$\begin{cases} 1 \le |i - j| \le k \\ l \le |a_i - a_j| \le r \end{cases}$

are suitable.

To begin, to see whether his army has any chance of winning, Aquaman wants to find any pair of creatures that can be sent into battle. Help him.

The first line contains four integers $n$, $k$, $l$, $r$: the number of creatures in Aquaman's army, and the limits on $|i - j|$ and $|a_i - a_j|$ respectively ($2 \le n \le 10^5$, $1 \le k < n$, $0 \le l \le r \le 10^9$).

The second line contains $n$ integers $a_1, a_2, \ldots, a_n$, the strengths of the creatures ($1 \le a_i \le 10^9$).

If a pair of creatures that can be sent exists, print the two indices $i$ and $j$ on a single line. If several pairs are possible, print any of them. If no such pair exists, print $-1$ and $-1$ on a single line.

In the first example, Aquaman has only one pair that can be sent into battle: $a_3 = 6$ and $a_5 = 4$, since $1 \le |3 - 5| \le 2$ and $2 \le |6 - 4| \le 3$.

In the second example, a pair can be sent only if the strengths are equal, but the array has no two equal elements.