INF=-1000000007
SQRT_N = 1024
N,D,K = map(int,input().split())
x = [int(input()) for i in range(N)]
b_size = (N + SQRT_N - 1) // SQRT_N
bucket = [(INF,INF) for i in range(b_size * SQRT_N)]
bucketMax = [(INF,INF) for i in range(b_size)]
def update(index,value):
	global bucket,SQRT_N,bucketMax
	k = index // SQRT_N
	bucket[index] = (index,value)
	ret = bucket[index]
	for i in range(k * SQRT_N,(k+1)*SQRT_N):
		if ret[1] < bucket[i][1]:
			ret = bucket[i]
		elif ret[1] == bucket[i][1] and ret[0] > bucket[i][0]:
			ret = bucket[i]
	bucketMax[k] = ret
def query(left,right):
	global b_size
	ret = (INF,INF)
	for i in range(b_size):
		l = i * SQRT_N
		r = (i+1) * SQRT_N
		if r <= left or right <= l:
			continue
		if left <= l and r <= right:
			if ret[1] < bucketMax[i][1]:
				ret = bucketMax[i]
			elif ret[1] == bucketMax[i][1] and ret[0] > bucketMax[i][0]:
				ret = bucketMax[i]
		else:
			for j in range(max(left,l),min(right,r)):
				if ret[1] < bucket[j][1]:
					ret = bucket[j]
				elif ret[1] == bucket[j][1] and ret[0] > bucket[j][0]:
					ret = bucket[j]
	return ret
for i in range(N):
	update(i,x[i])
ans = 0
pair = [INF,INF]
for i in range(N-1):
	ret = query(i+1,min(N,i+D+1))
	if ans < ret[1]-x[i]:
		ans = ret[1]-x[i]
		pair = [i,ret[0]]
if ans <= 0:
	print(0)
else:
	print(ans*K)
	print(' '.join([str(_) for _ in pair]))