#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;

//x.size() > k, 
vector<ll> slide_max(const vector<ll>& x, int k){
  vector<ll> ret(x.size(), 0);
  deque<ll> deq;
  for(int i=0; i<x.size(); i++){
    while(deq.size()>0 && x[deq[deq.size()-1]]<=x[i]) deq.pop_back();
    deq.push_back(i);
    
    if(i-k+1 >= 0){
      ret[i-k+1] = x[deq[0]];
      if(deq[0] == i-k+1) deq.pop_front();
    }
  }
  //
  for(int i=x.size()-k+1; i<x.size(); i++){
    ret[i] = ret[x.size()-k];
  }
  return ret;
}

int main(){
  ll N, D, K;
  cin >> N >> D >> K;
  vector<ll> x;
  rep(i,N){
    ll a;
    cin >> a;
    x.push_back(a);
  }

  D++;
  
  vector<ll> mx = slide_max(x, D);
  
  ll best = 0;
  int best_i = 0;
  rep(i,N){
    //cout << x[i] << " " << mx[i] << endl;
    if(mx[i]-x[i]>best){
      best = mx[i]-x[i];
      best_i = i;
    }
  }
  if(best == 0){
    cout << 0 << endl;
  }else{
    cout << best*K << endl;
    cout << best_i << " ";
    REP(i,best_i,best_i+D){
      if(x[i] == mx[best_i]){
        cout << i;
        break;
      }
    }
    cout << endl;
  }

  
  return 0;
}