#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,d,k,l=0,I,J,a[100005];
deque<ll>q;
int main(){
//	freopen("stock.in","r",stdin);
//	freopen("stock.out","w",stdout);
	cin>>n>>d>>k;
	for(ll i=0;i<n;i++)cin>>a[i];
	for(ll j=0;j<n;j++){
		while(!q.empty()&&j-q.front()>d)q.pop_front();
		if(!q.empty()){
			ll i=q.front(),diff=a[j]-a[i];
			if(diff>l)l=diff,I=i,J=j;
		}
		while(!q.empty()&&a[q.back()]>=a[j])q.pop_back();
		q.push_back(j);
	}
	if(l==0&&I==0&&J==0){
		cout<<0;
		return 0;
	}
	cout<<l*k<<endl<<I<<" "<<J<<endl;
}