#include <bits/stdc++.h>

#ifndef LOCAL_
#define fprintf if( false ) fprintf
#endif // LOCAL_
#define dumpi(x1) fprintf(stderr, "#%s.%d (%s) = (%d)\n", __func__, __LINE__, #x1, x1);
#define dumpii(x1, x2) fprintf(stderr, "#%s.%d (%s, %s) = (%d, %d)\n", __func__, __LINE__, #x1, #x2, x1, x2);
#define dumpiii(x1, x2, x3) fprintf(stderr, "#%s.%d (%s, %s, %s) = (%d, %d, %d)\n", __func__, __LINE__, #x1, #x2, #x3, x1, x2, x3);
#define dumpl(x1) fprintf(stderr, "#%s.%d (%s) = (%ld)\n", __func__, __LINE__, #x1, x1);
#define dumpll(x1, x2) fprintf(stderr, "#%s.%d (%s, %s) = (%ld, %ld)\n", __func__, __LINE__, #x1, #x2, x1, x2);
#define dumpd(x1) fprintf(stderr, "#%s.%d (%s) = (%lf)\n", __func__, __LINE__, #x1, x1);
#define dumpdd(x1, x2) fprintf(stderr, "#%s.%d (%s, %s) = (%lf, %lf)\n", __func__, __LINE__, #x1, #x2, x1, x2);

struct S002 {
  int n;
  S002& operator > (long& x) {
    n = x;
    return *this;
  }
  S002& operator >= (long& x) {
    if( scanf("%ld", &x) <= 0 ) exit(0);
    return *this;
  }
  S002& operator >= (double& x) {
    if( scanf("%lf", &x) <= 0 ) exit(0);
    return *this;
  }
  S002& operator >= (std::string& s) {
    if( not (std::cin >> s) ) exit(0);
    return *this;
  }
  template<typename a>
  S002& operator >= (std::vector<a>& v) {
    v.resize(n);
    for(long i = 0; i < n; ++i) {
      *this >= v[i];
    }
    return *this;
  }
};

template<typename a>
struct S003 {
  std::vector<a> ys;
  S003(std::vector<a> xs, long k, long s) {
    long n = xs.size();
    ys.resize(n);
    std::deque<a> q;
    for(long i = 0; i < n + k - 1; ++i) {
      if( i < n ) {
        while( not q.empty() and s * xs[q.back()] <= s * xs[i]) q.pop_back();
        q.push_back(i);
      }
      long w = i - k + 1;
      if( w >= 0 ) {
        ys[w] = xs[q.front()];
        if( q.front() == w ) q.pop_front();
      }
    }
  }
  typename std::vector<a>::iterator begin() {
    return ys.begin();
  }
  typename std::vector<a>::iterator end() {
    return ys.end();
  }
  size_t size() {
    return ys.size();
  }
  a operator [] (int i) {
    return ys[i];
  }
};

struct Solver {
  long n, d, k;
  std::vector<long> xs;
  Solver() {
    S002 r;
    r >= n >= d >= k >n>= xs;
  }
  void solve() {
    S003<long> s(xs, d + 1, 1);
    std::vector<long> zs;
    for(int i = 0; i < (int)s.size(); ++i) {
      zs.push_back(s[i] - xs[i]);
    }
    long max = *std::max_element(zs.begin(), zs.end());
    auto it = std::find(zs.begin(), zs.end(), max);
    long x = it - zs.begin();
    auto it2 = std::find(xs.begin() + x, xs.end(), xs[x] + max);
    long y = it2 - xs.begin();
    if( max * k == 0 ) {
      puts("0");
      return;
    }
    printf("%ld\n", max * k);
    printf("%ld %ld\n", x, y);
  }  
};

int main() {
  for(;;) {
    std::unique_ptr<Solver> s(new Solver());
    s->solve();
  }
  return 0;
}