k-d-sequence

Description:

Input:

The first line contains three space-separated integers n, k, d (1 ≤ n ≤ 2·10⁵; 0 ≤ k ≤ 2·10⁵; 0 ≤ d ≤ 10⁹). The second line contains n space-separated integers: a₁, a₂, ..., a_n ( - 10⁹ ≤ a_i ≤ 10⁹) — the actual sequence.

Output:

Print two space-separated integers l, r (1 ≤ l ≤ r ≤ n) show that sequence a_l, a_l + 1, ..., a_r is the longest subsegment that is a good k-d sequence.

If there are multiple optimal answers, print the one with the minimum value of l.

Sample Input:

6 1 2
4 3 2 8 6 2

Sample Output:

3 5

Note:

In the first test sample the answer is the subsegment consisting of numbers 2, 8, 6 — after adding number 4 and sorting it becomes sequence 2, 4, 6, 8 — the arithmetic progression with difference 2.