#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define each(a, b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define pb push_back
#define show(x) cout <<#x<<" = "<<(x)<<endl
#define spair(p) cout <<#p<<": "<<p.fi<<" "<<p.se<<endl
#define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl
#define sset(s) cout<<#s<<":";each(kbrni,s)cout <<" "<<kbrni;cout<<endl

using namespace std;

typedef pair<int,int>P;

const int MAX_N = 100005;

int main()
{
    int n,d,K;
    cin >> n >> d >> K;
    vector<int> vec(n);
    vector<int> deq(n+2);
    rep(i,n){
        cin >> vec[i];
    }
    vector<P> res(n-d+1);
    int s = 0,t = 0;
    vector<P> st(d-1);
    rep(i,n){
        while(s < t && vec[deq[t-1]] > vec[i]){
            t--;
        }
        deq[t++] = i;
        if(i-d+1 >= 0){
            res[i-d+1] = P(vec[deq[s]],deq[s]);
            if(deq[s] == i-d+1){
                s++;
            }
        }else{
            st[i] = P(vec[deq[s]],deq[s]);
        }
    }
    int mx = 0;
    int a1,a2;
    rep(i,d-1){
        if(mx < vec[i+1]-st[i].fi){
            mx = vec[i+1]-st[i].fi;
            a1 = st[i].se;
            a2 = i+1;
        }
    }
    rep(i,n-d){
        if(mx < vec[i+d]-res[i].fi){
            mx = vec[i+d]-res[i].fi;
            a1 = res[i].se;
            a2 = i+d;
        }
    }
    if(mx){
        cout << (ll)mx*K << endl;
        cout << a1 << " " << a2 << endl;
    }else{
        cout << 0 << endl;
    }
    return 0;
}