N = 1 << 17
INF = 10 ** 9
n, d, K = map(int, input().split())
x = [int(input()) for _ in range(n)]

dat = [(INF, INF)] * (N * 2)

def seg_update(k, v):
    global dat
    dat[k + N] = (v, i)
    k += N
    while k > 1:
        dat[k >> 1] = min(dat[k], dat[k ^ 1])
        k >>= 1

def seg_query(l, r, k = 1, ll = 0, rr = N):
    if rr <= l or r <= ll:
        return (INF, INF)
    if l <= ll and rr <= r:
        return dat[k]
    vl = seg_query(l, r, k * 2 + 0, ll, (ll + rr) // 2)
    vr = seg_query(l, r, k * 2 + 1, (ll + rr) // 2, rr)
    return min(vl, vr)

for i in range(n):
    seg_update(i, x[i])

opt = (0, 0, 0)
for i in range(1, n):
    j = max(0, i - d)
    val = seg_query(j, i)
    opt = max(opt, (x[i] - val[0], -val[1], -i))

if opt[0] == 0:
    print(0)
else:
    print(opt[0] * K)
    print(-opt[1], -opt[2])