#include<bits/stdc++.h>
using namespace std;
int x[100005],q[100005];
int main(){
	int n,d,k;
	scanf("%d%d%d",&n,&d,&k);
	for(int i=0;i<n;++i)scanf("%d",&x[i]);
	int hd=1,tl=0;
	long long ans=0;
	int u=0,v=0;
	for(int i=n-1;i>=0;--i){
		while(hd<=tl&&q[hd]>i+d)++hd;
		while(hd<=tl&&x[q[tl]]<=x[i])--tl;
		q[++tl]=i;
		if(hd<=tl){
			long long an=1ll*(x[q[hd]]-x[i])*k;
			if(ans<=an){
				ans=an;
				u=i,v=q[hd];
			}
		}
	}
	if(ans==0){
		puts("0");
		return 0;
	}
	printf("%lld\n",ans);
	printf("%d %d\n",u,v);
	return 0;
}