#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;

#include<atcoder/segtree>
pair<ll,ll> op(pair<ll,ll> a,pair<ll,ll> b){
    return max(a,b);
}
pair<ll,ll> e(){
    return make_pair(0,-1);
}
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll n,d,k;
    cin>>n>>d>>k;
    atcoder::segtree<pair<ll,ll>,op,e> seg(n);
    vector<ll> x(n);
    for(int i = 0;i<n;i++){
        cin>>x[i];
        seg.set(i,make_pair(x[i],-i));
    }
    ll ans = 0;
    int ni,nj;

    for(int i = 0;i<n;i++){
        int ri = i + d + 1;
        ri = min<int>(ri,n);
        auto now = seg.prod(i,ri);
        ll p = now.first;
        if(p==x[i]) continue;
        ll can = k * (p-x[i]);
        if(can<=ans) continue;
        ans = can;
        ni = i;
        nj = -now.second;
    }
    cout<<ans<<endl;
    if(ans==0) return 0;
    cout<<ni<<" "<<nj<<endl;
}