#include <iostream>
#include <vector>
#include <set>
using namespace std;
int main(){
    int n,d,K,m=0,j=0,k=0;
    cin>>n>>d>>K;
    vector<int> x(n);
    for(int &i:x) cin>>i;
    set<pair<int,int>> s;
    for(int i=0;i<=d;++i) s.insert({x[i],i});
    for(int i=0;i<n;++i){
        auto p = s.upper_bound({(--s.end())->first-1,n});
        if(p->first-x[i]>m){
            m=p->first-x[i];
            j=i;
            k=p->second;
        }
        s.erase({x[i],i});
        if(i+d+1<n) s.insert({x[i+d+1],i+d+1});
    }
    cout<<m*K<<endl;
    if(m) cout<<j<<" "<<k<<endl;
    return 0;
}