#include <cstdio>
#include <algorithm>
#define repeat(i,n) for (int i = 0; (i) < int(n); ++(i))
#define repeat_from(i,m,n) for (int i = (m); (i) < int(n); ++(i))
using ll = long long;
using namespace std;
constexpr int MAX_N = 1e5;
int x[MAX_N];
int main() {
    int n, d, K; scanf("%d%d%d", &n, &d, &K);
    repeat (i,n) scanf("%d", &x[i]);
    int mx = 0, mj = 0, mk = 0;
    repeat (j,n) {
        repeat_from (k,j,min(n,j+d+1)) {
            if (mx < x[k] - x[j]) {
                mx = x[k] - x[j];
                mj = j;
                mk = k;
            }
        }
    }
    printf("%lld\n", mx*(ll)K);
    if (mx) printf("%d %d\n", mj, mk);
    return 0;
}