/* -*- coding: utf-8 -*-
 *
 * 489.cc: No.489 株に挑戦 - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100000;
const int MAX_E2 = 1 << 18; // 262144
const int INF = 1 << 30;

/* typedef */

typedef long long ll;

struct Val {
  int v, i;
  Val() {}
  Val(int _v, int _i): v(_v), i(_i) {}
  bool operator<(const Val &a) const {
    return v < a.v || (v == a.v && i > a.i);
  }
  bool operator>(const Val &a) const {
    return v > a.v || (v == a.v && i < a.i);
  }
};

template <typename T, const int MAX_E2>
struct SegTreeMax {
  int n, e2;
  T nodes[MAX_E2], initv;
  SegTreeMax() {}

  void init(int _n, T _initv) {
    n = _n;
    initv = _initv;
    for (e2 = 1; e2 < n; e2 <<= 1);
    fill(nodes, nodes + MAX_E2, initv);
  }

  T get(int i) { return nodes[e2 - 1 + i]; }
  void set(int i, T v) { nodes[e2 - 1 + i] = v; }

  void set_all() {
    for (int j = e2 - 2; j >= 0; j--) {
      int j0 = j * 2 + 1, j1 = j0 + 1;
      nodes[j] = max(nodes[j * 2 + 1], nodes[j * 2 + 2]);
    }
  }

  T max_range(int r0, int r1, int k, int i0, int i1) {
    if (r1 <= i0 || i1 <= r0) return initv;
    if (r0 <= i0 && i1 <= r1) return nodes[k];

    int im = (i0 + i1) / 2;
    T v0 = max_range(r0, r1, k * 2 + 1, i0, im);
    T v1 = max_range(r0, r1, k * 2 + 2, im, i1);

    return max(v0, v1);
  }

  T max_range(int r0, int r1) {
    return max_range(r0, r1, 0, 0, e2);
  }
};

/* global variables */

SegTreeMax<Val,MAX_E2> stm;

/* subroutines */

/* main */

int main() {
  int n, d, k;
  cin >> n >> d >> k;

  stm.init(n, Val(0, -1));

  for (int i = 0; i < n; i++) {
    int xi;
    cin >> xi;
    stm.set(i, Val(xi, i));
  }
  stm.set_all();

  int maxx = 0, mini = -1, minj = -1;
  for (int i = 0; i < n; i++) {
    Val v = stm.max_range(i + 1, i + 1 + d);
    int x = v.v - stm.get(i).v;
    if (maxx < x)
      maxx = x, mini = i, minj = v.i;
  }

  //printf("%d %d %d\n", maxx, mini, minj);
  if (maxx <= 0) puts("0");
  else printf("%lld\n%d %d\n", (ll)maxx * k, mini, minj);
  return 0;
}