INF=-1000000007
N,D,K = map(int,input().split())
x = [int(input()) for i in range(N)]
seg = []
size = 1 << 17
seg=[[INF,INF]]* (size*2)
def seg_update(i,X):
	tmp=[X,i]
	i = size+i-1
	seg[i]=tmp
	while i > 0:
		i = (i-1)>>1
		s1=seg[i*2+1];s2=seg[i*2+2]
		if s1[0] < s2[0]:
			seg[i] = s2
		elif s1[0] > s2[0]:
			seg[i] = s1
		else:
			if s1[1] < s2[1]:
				seg[i] = s1
			else:
				seg[i] = s2

def seg_query(a,b,k,l,r):
	if r <= a or b <= l:
		return [INF,INF]
	if a <= l and r <= b:
		return seg[k]
	c = 2 * k
	d = (l + r) // 2

	left=seg_query(a,b,c+1,l,d)
	right=seg_query(a,b,c+2,d,r)
	if left[0] < right[0] or (right[0] >= left[0] and left[1] >= right[1]):
		return right
	return left
for i in range(N):
	seg_update(i,x[i])
ans=INF
pair=[INF,INF]
for i in range(N-1):
	ret=seg_query(i+1,min(N,i+D+1),0,0,size+1)
	if ans < ret[0]-x[i]:
		ans=ret[0]-x[i]
		pair=[i,ret[1]]
if ans <= 0:
	print(0)
else:
	print(ans*K)
	print(pair[0],pair[1])