#include<stdio.h>

long long x[100000];

int main(int argc, char const *argv[]){
	long long n,d,k,i,c,max=0,sell,min_i,next_min;
	scanf("%lld %lld %lld",&n,&d,&k);
	for(i=0;i<n;i++){
		scanf("%lld",&x[i]);
	}
	i=0;
	while(i<n){
		for(c=0;c<=d;c++){
			if(i+c>=n) break;
			if(max<x[i+c]-x[i]){
				min_i=i;
				sell=i+c;
				max=x[i+c]-x[i];
			}
			if(x[i+c]<=x[i] && c!=0){
				i=i+c-1;
				break;
			}
		}
		i++;
	}
	if(max==0) printf("0\n");
	else printf("%lld\n%lld %lld\n",max*k,min_i,sell);
	return 0;
}