import sys
input=lambda: sys.stdin.readline().rstrip()
inf=float("inf")
n,d,k=map(int,input().split())
X=[inf]*d+[int(input()) for _ in range(n)]+[inf]*d
from collections import deque
def Slide_Min(A,n,k):
  M=deque()
  ret=[]
  M.append(0)
  for i in range(n):
    while M:
      if A[M[-1]]>A[i]:
        M.pop()
      else:
        M.append(i)
        break
    if not M:
      M.append(i)
    if M[0]==i-k:
      M.popleft()
    if i<k-1:
      continue
    else:
      ret.append((A[M[0]],M[0]))
  return ret
SM=Slide_Min(X,n+2*d,d+1)
Ans=[0,0,0]
for i in range(n):
  if X[i+d]-SM[i][0]>Ans[0]:
    Ans=(X[i+d]-SM[i][0],SM[i][1]-d,i)
if Ans==[0,0,0]:
  print(0)
else:
  print(k*Ans[0])
  print(*Ans[1:])