X[0x40000];

f(i,j){
	int b=1e9;
	while(i<=j){
		if(i&1){
			if(b>X[i])b=X[i];
			++i;
		}
		if(!(j&1)){
			if(b>X[j])b=X[j];
			--j;
		}
		i=0x20000|i>>1;
		j=0x20000|j>>1;
	}
	return b;
}


main(){
	int i,j,n,d,k,b;
	int j0,j1;
	scanf("%d%d%d",&n,&d,&k);
	for(i=0;i<n;++i){
		scanf("%d",&X[i]);
	}

	for(i=0;i<0x20000;++i){
		int x0=X[i<<1|0];
		int x1=X[i<<1|1];
		X[i|0x20000]=x0<x1?x0:x1;
	}

	b=0;
	for(i=0;i<n;++i){
		int z=f(j=i-d<0?0:i-d,i);
		int c=X[i]-f(j=i-d<0?0:i-d,i);
		if(b<c) b=c,j1=i;
	}
	if(b){
		for(i=j1-d;i<j1;++i){
			if (b==X[j1]-X[i]){
				j0=i;
				break;
			}
		}
		printf("%lld\n%d %d\n",1ll*b*k,j0,j1);
	}else{
		puts("0");
	}
}