#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) FOR(i,0,n)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define PQ priority_queue
#define UM unordered_map
#define ALL(a) (a).begin(),(a).end()
#define MOD 1000000007
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
const ll INF = (1ll << 30);
typedef pair<ll,ll> pii;
typedef vector<vector<ll>> Graph;
typedef vector<pii> vpii;
int main() {
  ll N,D,K; cin>>N>>D>>K;
  vi x(N); REP(i,N) cin>>x[i];
  multiset<pii> S;
  ll ans=0;
  pii ansp;

  REP(i,D) {
    if(S.begin()!=S.end()) {
      if(ans<x[i]-(*S.begin()).first) {
        ans=max(ans,x[i]-(*S.begin()).first);
        ansp={(*S.begin()).second,i};
      }
    }
    S.insert({x[i],i});
  }

  FOR(i,D,N) {
    if(ans<x[i]-(*S.begin()).first) {
      ans=max(ans,x[i]-(*S.begin()).first);
      ansp={(*S.begin()).second,i};
    }
    S.insert({x[i],i});
    S.erase(S.find({x[i-D],i-D}));
  }

  cout<<ans*K<<endl;
  if(ans) {
    cout<<ansp.first<<' '<<ansp.second<<endl;
  }
}