from collections import deque

n, d, k = map(int, input().split())
x = [int(input()) for _ in range(n)]

idx = deque()
dq = deque()
for i in range(n):
  while len(dq) > 0 and x[i] <= x[dq[-1]]:
    dq.pop()

  dq.append(i)
  idx.append(dq[0])

  if len(dq) and dq[0] <= i + 1 - (d + 1):
    dq.popleft()

ans = 0
l = None
r = None
for i in range(n):
  score = (x[i] - x[idx[i]]) * k
  if score > ans:
    r = i
    l = idx[i]
    ans = score

if ans > 0:
  print(ans)
  print(f"{l} {r}")
else:
  print("0")