#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()

typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;

#define INF 1e9

const int MAX_N = 200010;

int n, width;
int dat[MAX_N*4];

void init(){
    width = 1;
    while(width<n) width*=2;
    REP(i,2*width-1) dat[i] = INF;
}

void update(int i, int x){
    i += width-1;
    dat[i] = x;
    while (i>0){
        i = (i-1)/2;
        dat[i] = min(dat[i*2+1],dat[i*2+2]);
    }
}

int query(int a, int b, int k, int l, int r){
    if (r<=a || b<=l) return INF;
    if (a<=l && r<=b) return dat[k];
    int vl = query(a,b,k*2+1,l,(l+r)/2);
    int vr = query(a,b,k*2+2,(l+r)/2,r);
    return min(vl,vr);
}

int main() {
    int d;
    ll kabu;
    cin >> n >> d >> kabu;
    init();
    VI x(n);
    REP(i,n){
        scanf("%d", &x[i]);
        update(i, x[i]);
    }
    ll ans = 0;
    int j, k;
    REP(i,n){
        int mi = query(max(0, i-d), i+1, 0, 0, width);
        if (x[i] - mi > ans){
            ans = x[i] - mi;
            k = i;
        }
    }

    if (ans == 0){
        cout << 0 << endl;
        return 0;
    }

    FOR(i,max(0,k-d),k){
        if (x[i] == x[k] - ans){
            j = i;
            break;
        }
    }

    ans *= kabu;
    printf("%lld\n%d %d\n", ans, j, k);

    return 0;
}