from collections import *
import sys

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())

def main():
    ii=deque()
    xx=deque()
    n,d,k=MI()
    mx=0
    ai=aj=0
    for i in range(n):
        x=II()
        if i==0:
            ii.append(i)
            xx.append(x)
            continue
        if ii and ii[0]<i-d:
            ii.popleft()
            xx.popleft()
        cur=x-xx[0]
        if cur>mx:
            mx=cur
            ai=ii[0]
            aj=i
        while xx and xx[-1]>=x:
            ii.pop()
            xx.pop()
        xx.append(x)
        ii.append(i)

    print(mx*k)
    if mx:print(ai,aj)

main()