#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;

int main(){
    ll n,d,k;
    cin >> n >> d >> k;
    vector<ll> x(n);
    rep(i,n) cin >> x[i];
    deque<ll> dq;
    dq.push_back(0);
    for(int i=1;i<d;i++){
        if(!dq.empty()){
            while(x[dq.back()] < x[i]){
                dq.pop_back();
                if(dq.size() == 0) break;
            }
        }
        dq.push_back(i);
    }
    ll ans = 0;
    int ansj = -1;
    int ansk = -1;
    for(int i=d;i<n;i++){
        if(!dq.empty()){
            while(x[dq.back()] < x[i]){
                dq.pop_back();
                if(dq.size() == 0) break;
            }
        }
        dq.push_back(i);

        if(k*(x[dq.front()] - x[i-d]) > ans){
            ans = k*(x[dq.front()] - x[i-d]);
            ansj = i-d;
            ansk = dq.front();
        }

        if(dq.front()==i-d) dq.pop_front();
    }
    for(int i=n;i<=n+d-1;i++){
        if(k*(x[dq.front()] - x[i-d]) > ans){
            ans = k*(x[dq.front()] - x[i-d]);
            ansj = i-d;
            ansk = dq.front();
        }

        if(dq.front()==i-d) dq.pop_front();
    }
    
    if(ans==0){
        cout << ans << endl;
    }else{
        cout << ans << endl;
        cout << ansj << " " << ansk << endl;
    }
    return 0;
}