#include<bits/stdc++.h>
 using namespace std;
#define INF 1000000000
#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
typedef long long LL;
int N,D,K;
int deq[100001];
LL x[100001];
int main(){
    cin>>N>>D>>K;
    REP(i,N){
        cin>>x[i];
    }
    deq[0]=0;
    int bg=0;
    int ed=1;
    LL ans=0;
    int l,r;
    REP(i,N){
        if(i==0)continue;
        while(ed>bg){
            if(x[deq[ed-1]]<=x[i])break;
            ed--;
        }
        deq[ed]=i;
        ed++;
        if(ans<x[i]-x[deq[bg]]){
           ans=x[i]-x[deq[bg]];
           l=bg;r=ed-1;
        }
        if(i>=D){
           if(i-D==bg)bg++;
        }
    }
    cout<<ans*K<<endl;
    if(ans!=0){
       cout<<l<<" "<<r<<endl;
    }
    return 0;
}