#include<bits/stdc++.h>
#define int long long
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
using namespace std;
template<typename T>istream&operator>>(istream&I,vector<T>&v){for(auto&i:v)I>>i;return I;}
template<typename T>ostream&operator<<(ostream&O,vector<T>&v){for(auto&i:v)O<<i<<' ';return O;}
namespace AC{
int tr[400010];
vector<int>x;
void build(int p,int l,int r){
	if(l==r){
		tr[p]=x[l];
		return;
	}
	int mid=l+r>>1;
	build(p<<1,l,mid);
	build(p<<1|1,mid+1,r);
	tr[p]=max(tr[p<<1],tr[p<<1|1]);
}
int query(int p,int l,int r,int s,int t){
	if(l>=s&&t>=r)return tr[p];
	int mid=l+r>>1,ans=-1;
	if(s<=mid)ans=max(ans,query(p<<1,l,mid,s,t));
	if(t>mid)ans=max(ans,query(p<<1|1,mid+1,r,s,t));
	return ans;
}
void solve(){
	int n,d,k;
	cin>>n>>d>>k;
	x.resize(n);
	cin>>x;
	bool bl=1;
	for(int i=0;i<n-1;i++)if(x[i]<x[i+1])bl=0;
	if(bl)cout<<"0";
	else{
		int ansb=-1,anse=-1,ans=0;
		build(1,0,n-1);
		for(int i=0;i<n;i++){
			int b=i+1,e=min(n-1,i+d);
			int tmp=query(1,0,n-1,b,e)-x[i];
			if(tmp>ans||tmp==ans&&b<ansb){
				ans=tmp;
				ansb=i;
				anse=tmp+x[i];
			}
		}
		cout<<ans*k<<endl;
		int anss=-1;
		for(int i=ansb+1;i<=ansb+d;i++)if(x[i]==anse){
			anss=i;
			break;
		}
		cout<<ansb<<' '<<anss<<endl;
	}
}
}
signed main(){
	int t=1;
	//cin>>t;
	while(t--)AC::solve();
}