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

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]
	left=seg_query(a,b,2*k+1,l,(l+r)>>1)
	right=seg_query(a,b,2*k+2,(l+r)>>1,r)
	if left[0] == INF:
		return right
	if right[0] == INF:
		return left
	if left[0] < right[0]:
		return right
	elif left[0] > right[0]:
		return left
	else:
		if left[1] < right[1]:
			return left
		else:
			return right
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])