from collections import defaultdict

class SegmentTree:
    def __init__(self, N):
        n_ = 1
        while n_ < N:
            n_ *= 2
        self.n = n_
        self.arr = [-10 ** 18] * (2*self.n - 1)
    
    def update(self, k, a):
        k += self.n - 1
        self.arr[k] = a
        while k > 0:
            k = (k - 1) // 2
            self.arr[k] = max(self.arr[2*k + 1], self.arr[2*k + 2])
        
    def query_sub(self, a, b, k, l, r):
        if r <= a or b <= l:
            return -10 ** 18
        
        if a <= l and r <= b:
            return self.arr[k]
        else:
            vl = self.query_sub(a, b, 2*k + 1, l, (l+r) / 2)
            vr = self.query_sub(a, b, 2*k + 2, (l+r) / 2, r)
            return max(vl, vr)
    
    def query(self, a, b):
        return self.query_sub(a, b, 0, 0, self.n)

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

for i in range(N):
    seg_tree.update(i, x[i])
    
dic = defaultdict(list)

for i in range(N):
    dic[x[i]].append(i)

ans1 = -10 ** 18

for i in range(N-D):
    m = seg_tree.query(i, i+D+1)
    
    if m - x[i] <= ans1:
        continue
    else:
        ans1 = m - x[i]
        ans2 = i
        
        for l_i in dic[m]:
            if i <= l_i:
                ans3 = l_i
                break

for i in range(N-D+1, N):
    m = seg_tree.query(i, N)
    
    if m - x[i] <= ans1:
        continue
    else:
        ans1 = m - x[i]
        ans2 = i
        
        for l_i in dic[m]:
            if i <= l_i:
                ans3 = l_i
                break
            
if ans1 == 0:
    print(0)
else:
    print(ans1 * K)
    print(ans2, ans3)