#include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
typedef long long LL;
LL N,D,K;
LL X[100001];
map<LL,int>m;
int main(){
	cin>>N>>D>>K;
	REP(i,N){
	   cin>>X[i];
	}
	LL ans=0;
	int mi=-1;
	int ma=-1;
	int num=-1;
	REP(i,N){
	    if(D<i){
	       m[X[i-(D+1)]]--;
	       if(m[X[i-(D+1)]]<=0)m.erase(X[i-(D+1)]);
	    }
	    if(m.find(X[i])==m.end()){
	       m[X[i]]=1;
	    }else{
	       m[X[i]]++;
	    }
	    LL temp=m.begin()->first;
	    if(X[i]-temp>ans){
	       num=i;
	       ma=X[i];
	       mi=temp;
	       ans=ma-mi;
	    }
	}
	if(ma==-1){
	   cout<<0<<endl;
	   return 0;
        }
        cout<<ans*K<<endl;
        for(int i=num;i>=0;i--){
            if(X[i]==mi){
               cout<<i<<" "<<num<<endl;
               return 0;
            }
        }
	return(0);
}