import sys
input = sys.stdin.readline

class SegmentTree:
    def __init__(self, size, f=min, default=10**18):
        self.size = 2**(size-1).bit_length() 
        self.default = default
        self.dat = [default]*(self.size*2) 
        self.f = f

    def update(self, i, x):
        i += self.size
        self.dat[i] = x
        while i > 0:
            i >>= 1
            self.dat[i] = self.f(self.dat[i*2], self.dat[i*2+1])

    def query(self, l, r):
        l += self.size
        r += self.size
        lres, rres = self.default, self.default
        while l < r:
            if l & 1:
                lres = self.f(lres, self.dat[l])
                l += 1

            if r & 1:
                r -= 1
                rres = self.f(self.dat[r], rres) 
            l >>= 1
            r >>= 1
        res = self.f(lres, rres)
        return res
    

N, D, K = map(int, input().split())
T = SegmentTree(N + 1)
ansval, ansind = 0, None
for i in range(N):
    x = int(input())
    T.update(i, x * (N + 1) + i)
    v = T.query(max(0, i - D), i)
    minv, mind = divmod(v, N + 1)
    temp = x - minv
    if temp > ansval:
        ansval = temp
        ansind = (mind, i)

if ansind:
    print(K * ansval)
    print(*ansind)
else:
    print(0)