n,D,K=map(int,input().split())
a=(0,0,0)
from collections import deque
q=deque()
for i in range(1):
  x=int(input())
  while len(q)>0 and q[-1][0]>x:
    q.pop()
  q.append((x,i))
for i in range(1,n):
  x=int(input())
  y,j=q[0]
  a=min(a,(-(x-y),j,i))
  while len(q)>0 and q[-1][0]>x:
    q.pop()
  q.append((x,i))
  if q[0][1]==i-D:
    q.popleft()
p1,p2,p3=a
if p1!=0:
  print(-p1*K)
  print(p2,p3)
else:
  print(0)