class SegmentTree:
    def __init__(self, arr, segfunc=min, ide_ele=float('inf')):
        self.arr = arr
        self.segfunc = segfunc
        self.ide_ele = ide_ele

        self.n = len(arr)
        self.num = 2**(self.n-1).bit_length()
        self.seg = [ide_ele]*2*self.num
        self._init_seg(self.arr)
    def _init_seg(self, init_val):
        for i in range(self.n):
            self.seg[i+self.num-1]=init_val[i]    
        for i in range(self.num-2,-1,-1):
            self.seg[i]=self.segfunc(self.seg[2*i+1],self.seg[2*i+2]) 
    def query(self, p, q):
        if q<=p:
            return self.ide_ele
        p += self.num-1
        q += self.num-2
        res=self.ide_ele
        while q-p>1:
            if p&1 == 0:
                res = self.segfunc(res,self.seg[p])
            if q&1 == 1:
                res = self.segfunc(res,self.seg[q])
                q -= 1
            p = p//2
            q = (q-1)//2
        if p == q:
            res = self.segfunc(res,self.seg[p])
        else:
            res = self.segfunc(self.segfunc(res,self.seg[p]),self.seg[q])
        return res
    def get_arr(self):
        return self.arr

N, D, K = map(int, input().split())
x = []
for _ in range(N):
    x.append(int(input()))
if N==2:
    if x[0] < x[1]:
        print((x[1]-x[0])*K)
        print(0, 1)
    else:
        print(0)
    exit(0)
st=SegmentTree(x,segfunc=max,ide_ele=0)
profit=-float('inf')
r=(0,1)
mini=0
for i in range(N-2):
    can = st.query(i+1,min(i+D+1,N-1))-x[i]
    if profit<can:
        profit=can
        r=(i+1,min(i+D+1,N-1))
        mini=i
minx=float('inf')
maxx=0
maxi=-1
for i in range(*r):
    if maxx<x[i]:
        maxx=x[i]
        maxi=i
print(profit*K)
if profit*K!=0:
    print(mini,maxi)