We'll call a sequence of integers a good *k*-*d* sequence if we can add to it at most *k* numbers in such a way that after the sorting the sequence will be an arithmetic progression with difference *d*.

You got hold of some sequence *a*, consisting of *n* integers. Your task is to find its longest contiguous subsegment, such that it is a good *k*-*d* sequence.
The first line contains three space-separated integers *n*, *k*, *d* (1 ≤ *n* ≤ 2·10<sup class="upper-index">5</sup>; 0 ≤ *k* ≤ 2·10<sup class="upper-index">5</sup>; 0 ≤ *d* ≤ 10<sup class="upper-index">9</sup>). The second line contains *n* space-separated integers: *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub> ( - 10<sup class="upper-index">9</sup> ≤ *a*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">9</sup>) — the actual sequence.
n, k, d = map(int, input().split())
a = list(map(int, input().split()))

best_l, best_r = 1, 1
cur_l, cur_r = 1, 1
added = 0
min_val, max_val = a[0], a[0]

for r in range(1, n):
    if a[r] < min_val:
        min_val = a[r]
    if a[r] > max_val:
        max_val = a[r]
    
    while (max_val - min_val) > d:
        if a[cur_l] == min_val:
            min_val = min(a[cur_r:r+1])
        if a[cur_l] == max_val:
            max_val = max(a[cur_r:r+1])
        cur_l += 1

    if r - cur_l + 1 > best_r - best_l + 1 + k:
        cur_l += 1
    else:
        if r - cur_l + 1 > best_r - best_l + 1:
            best_l, best_r = cur_l, r
print(best_l, best_r + 1)
