#include<bits/stdc++.h>
using namespace std;

#define int long long

typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
template<class T,class U>void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>void chmax(T &t,U f){if(t<f)t=f;}

signed main(){
    int N,D,K;
    cin>>N>>D>>K;
    vint X(N);rep(i,N)cin>>X[i];

    deque<int>d;
    int ans=0;
    pint a;
    rep(i,N){
        while(d.size()&&i-d.front()>D)d.pop_front();
        if(d.size()&&X[i]-X[d.front()]>ans){
            ans=X[i]-X[d.front()];
            a=pint(d.front(),i);
        }
        if(d.size()&&X[i]-X[d.front()]>=ans){
            chmin(a,pint(d.front(),i));
        }
        while(d.size()&&X[d.back()]>=X[i])d.pop_back();
        d.push_back(i);
    }

    if(ans==0)cout<<0<<endl;
    else{
        cout<<ans*K<<endl;
        cout<<a.fi<<" "<<a.se<<endl;
    }
    return 0;
}