#include<iostream>
#include<deque>
using namespace std;
int N,D,K;
int x[1<<17];
int ans=-1,ai,aj;
main()
{
	cin>>N>>D>>K;
	deque<int>P;
	for(int i=0;i<N;i++)
	{
		cin>>x[i];
		while(!P.empty()&&P.front()+D<i)P.pop_front();
		while(!P.empty()&&x[P.back()]>x[i])P.pop_back();
		P.push_back(i);
		if(ans<x[i]-x[P.front()])
		{
			ans=x[aj=i]-x[ai=P.front()];
		}
	}
	if(ans>0)cout<<(long)K*ans<<endl<<ai<<" "<<aj<<endl;
	else cout<<0<<endl;
}