#include<bits/stdc++.h>

using namespace std;

const int INF = 1 << 30;
typedef pair< int, int > Pi;

int N, D, K, X[100000];

int solve(int output = -INF)
{
  priority_queue< Pi, vector< Pi >, greater< Pi > > que;
  int ret = 0;
  for(int i = 0; i < N; i++) {
    while(!que.empty() && i - que.top().second > D) que.pop();
    if(que.size()) {
      ret = max(ret, X[i] - que.top().first);
      if(ret > 0 && ret == output) {
        cout << 1LL * (X[i] - que.top().first) * K << endl;
        cout << que.top().second << " " << i << endl;
        return (INF);
      }
    }
    que.emplace(X[i], i);
  }
  return (ret);
}

int main()
{
  cin >> N >> D >> K;
  for(int i = 0; i < N; i++) cin >> X[i];
  if(!solve(solve())) cout << 0 << endl;
}