#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<map>
#include<queue>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
using namespace std;


int main(){

  int n, d, k;
  cin >> n >> d >> k;
  vector<int> x(n);
  for(int i=0; i<n; i++) cin >> x[i];

  int lmax = 0;
  int rmax = 0;
  int diffmax = 0;
  int r = 0;
  for(int l=0; l<n; l++){
    // r = l;
    while(r - l <= d){
      if( r >= n ) break;

      if( diffmax < x[r] - x[l] ){
        lmax = l;
        rmax = r;
        diffmax = x[r] - x[l];
      }

      r++;
    }

  }

  long long int ans = diffmax * k;
  cout << ans << endl;
  if( ans != 0 ) cout << lmax << " " << rmax << endl;

  return 0;
}