import sys
sys.setrecursionlimit(10000000)
MOD = 10 ** 9 + 7
INF = 10 ** 15

from heapq import heapify,heappop,heappush
def main():
    N,D,K = map(int,input().split())
    X = [int(input()) for _ in range(N)]

    q = [(-x,i) for i,x in enumerate(X[:D + 1])]
    heapify(q)
    ans = 0
    day1,day2 = -1,-1
    for i in range(N):
        while q[0][1] < i:
            heappop(q)
        p = -q[0][0]
        if ans < p - X[i]:
            day1 = i
            day2 = q[0][1]
            ans = max(ans,p - X[i])
        if i + D + 1 < N:
            heappush(q,(-X[i + D + 1],i + D + 1))
    if day1 < 0:
        print(0)
    else:
        print(ans * K)
        print(day1,day2)
if __name__ == '__main__':
    main()