N,D,K = map(int,input().split())
x = [int(input()) for _ in range(N)]

from collections import deque
q = deque()
for i in range(D+1):
    while q and x[q[-1]] < x[i]:
        q.pop()
    q.append(i)
ans = 0
left = -1
right = -1
for i in range(N):
    tmp = x[q[0]] - x[i]
    if tmp > ans:
        ans = tmp
        left = i
        right = q[0]
    if i + D + 1 < N:
        while q and x[q[-1]] < x[i+D+1]:
            q.pop()
        q.append(i+D+1)
    if q[0] == i:
        q.popleft()
if ans == 0:
    print(0)
else:
    print(ans * K)
    print(left,right)