#include <bits/stdc++.h>
using namespace std;

#define _p(...) (void)printf(__VA_ARGS__)
#define forr(x,arr) for(auto&& x:arr)
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)
#define _rrep2(i,n) _rrep3(i,0,n)
#define _rrep3(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define bit(n) (1LL<<(n))
#define sz(x) ((int)(x).size())
#define fst first
#define snd second
using ll=long long;
using pii=pair<int,int>;using pll=pair<ll,ll>;using pil=pair<int,ll>;using pli=pair<ll,int>;
using vs=vector<string>;using vvs=vector<vs>;using vvvs=vector<vvs>;
using vb=vector<bool>;using vvb=vector<vb>;using vvvb=vector<vvb>;
using vi=vector<int>;using vvi=vector<vi>;using vvvi=vector<vvi>;
using vl=vector<ll>;using vvl=vector<vl>;using vvvl=vector<vvl>;
using vd=vector<double>;using vvd=vector<vd>;using vvvd=vector<vvd>;
using vpii=vector<pii>;using vvpii=vector<vpii>;using vvvpii=vector<vvpii>;
template<class T,class U>istream&operator>>(istream&is,pair<T,U>&P){is>>P.fst;is>>P.snd;return is;}
template<class T>T read(){T t;cin>>t;return t;}
template<class T,class U>ostream&operator<<(ostream&o,const pair<T,U>&p){return o<<'('<<p.fst<<", "<<p.snd<<')';}
template<class T>ostream&operator<<(ostream&o,const vector<T>&t){o<<"{";rep(i,sz(t))o<<t[i]<<",";o<<"}"<<endl;return o;}
vs s_p_l_i_t(const string&s,char c){vs v;stringstream ss(s);string x;while(getline(ss,x,c))v.emplace_back(x);return (v);}
void e_r_r(vs::iterator it){cerr<<endl;}
template<class T,class... Args>void e_r_r(vs::iterator it,T a,Args... args){cerr<<it->substr((*it)[0]==' ',it->length())<<" = "<<a<<", ";e_r_r(++it,args...);}
#define out(args...){vs a_r_g_s=s_p_l_i_t(#args,',');e_r_r(a_r_g_s.begin(),args);}

template<class V> struct SegTreeMax0 {
  const int n;
  vector<V> val;

  SegTreeMax0(int _n): n(p2(_n)), val(n * 2) {}
  void reinit() {
    val.fill({-1, -1});
  }
  V getval(int a, int b) {
    return getval(a, b, 0, 0, n);
  }
  void update(int i, V v) {
    i += n - 1;
    val[i] = v;
    while (i > 0) {
      i = (i - 1) / 2;
      val[i] = max(val[i * 2 + 1], val[i * 2 + 2]);
    }
  }

  private:
  V getval(int a, int b, int k, int l, int r) {
    if (r <= a || b <= l) return {-1, -1};;
    if (a <= l && r <= b) return val[k];
    return max(getval(a, b, k * 2 + 1, l, (l + r) / 2), getval(a, b, k * 2 + 2, (l + r) / 2, r));
  }
  static int p2(int n, int m=1) { return m >= n ? m : p2(n, m * 2); }
};

template<class T> bool amax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }

void Main() {
  int n = read<int>();
  int d = read<int>();
  int k = read<int>();
  vector<int> A(n);
  rep(i, n) A[i] = read<int>();

  SegTreeMax0<pii> seg(n);
  rep(i, n) {
    seg.update(i, {A[i], -i});
  }

  int ans = 0;
  int l=0, r=0;
  rep(i, n) {
    int a = A[i];
    pii b = seg.getval(i, i+d+1);
    if (amax(ans, b.fst - a)) {
      l = i;
      r = -b.snd;
    }
  }
  if ( ans == 0) {
    cout << 0 << endl;
  }
  else {
    cout << (ans*k) << endl;
    cout << (l) << ' ' << (r) << endl;
  }

}
int main() { cin.tie(nullptr); ios::sync_with_stdio(false); Main(); return 0; }