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, k)
    k += N
    while k > 1:
        dat[k >> 1] = min(dat[k], dat[k ^ 1])
        k >>= 1

mn = (INF, INF)
l = 0
r = 0
def sub(k, ll, rr):
    global mn
    if l <= ll and rr <= r:
        mn = min(mn, dat[k])
        return
    mm = (ll + rr) // 2
    if mm > l:
        sub(k * 2 + 0, ll, mm)
    if mm < r:
        sub(k * 2 + 1, mm, rr)

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

opt = (0, 0, 0)
for i in range(1, n):
    sub(1, 0, N)
    j = max(0, i - d)
    l = j
    r = i
    mn = (INF, INF)
    sub(1, 0, N)
    val = mn
    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])