#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;

template <typename T> 
struct SegmentTree {
  
  int n;
  vector<T> node;

  T f(T a, T b) {return max(a, b);}

  SegmentTree (int sz, T init = 0) {
    n = 1; while (n < sz) n <<= 1;
    node.assign(2*n, init);
  }

  void update(int k, T x) {
    k += (n - 1);
    node[k] = x;
    while (k > 0) {
      k = (k - 1) >> 1;
      node[k] = f(node[2*k+1], node[2*k+2]);
    } 
  }

  T query(int a, int b, int k = 0, int l = 0, int r = -1) {
    if (r < 0) r = n;
    if (r <= a || b <= l) return 0;
    if (a <= l && r <= b) return node[k];
    T vl = query(a, b, 2*k+1, l, (l+r)/2);
    T vr = query(a, b, 2*k+2, (l+r)/2, r);
    return f(vl, vr);
  }

  T getvalue(int k) {
    return query(k,k+1);
  }

};

int main(){
  int n, d, k;
  cin >> n >> d >> k;
  SegmentTree<ll> seg(n);
  vector<int> x(n);
  rep(i,n) {
    cin >> x[i];
    seg.update(i,x[i]);
  }
  ll res = 0;
  int midx = -1;
  for (int i = 0; i + d < n; i++) {
    ll dif = seg.query(i,i+d+1);
    ll v = dif - seg.getvalue(i);
    if (res < v) {
      res = v;
      midx = i;
    }
  }
  cout << res * k << endl;
  if (res > 0) {
    for (int i = 0; i <= d; i++) {
      if (x[midx + i] - x[midx] == res) {
        cout << midx << " " << i << endl;
        return 0;
      }
    }
  }
  return 0;
}