#include <bits/stdc++.h>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))
#define fi first
#define se second
#define dbg(x) cout<<#x" = "<<((x))<<endl
template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;}
template<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}

#define INF 2147483600
#define long long long // for codeforces

int main(){
  long n,d,k;
  cin>>n>>d>>k;
  vector<int> vec(n);
  rep(i,n) cin>>vec[i];

  set<pair<long,int>> m;
  m.insert(mp(vec[0], 0));

  long mx=0;
  int mxi, mni;
  repl(i,1,n){
    // iでとりだす
    long t = vec[i] - m.begin()->fi;
    if(mx < t){
      mx = t;
      mxi = i;
      mni = m.begin()->se;
    }
    m.insert(mp(vec[i],i));
    if(i-d>=0) m.erase(mp(vec[i-d], i-d));
  }
  cout << mx*k << endl;
  if(mx>0) cout << mni << " " << mxi << endl;

  return 0;
}