#include <iostream>
#include <vector>
#include <deque>
using namespace std;
#define ll long long
int main(){
    ll n, d, K;
    cin >> n >> d >> K;
    vector<ll> x(n);
    for(ll& e: x) cin >> e;
    deque<int> q;
    int j = 0, k = 0;
    ll r = 0;
    for(int i=0; i<n+d-1; ++i){
        if(i < n){
            while(q.size() && x[q.back()]<x[i]) q.pop_back();
            q.push_back(i);
        }
        if(q.front() == i-d) q.pop_front();
        if(i>=d && x[q.front()]-x[i-d]>r){
            j = i-d;
            k = q.front();
            r = x[k] - x[j];
        }
    }
    cout << r*K << endl;
    if(r) cout << j << " " << k << endl;
}