//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 0xccccccc;
const ll LINF = 922337203685477580LL;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}

const int N = 1e5+10;

//head

int n, d, k;
deque<P> dq;
int ma;
P fb;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> d >> k;
  rep(i, n) {
    int x;
    cin >> x;
    if(!dq.empty() and dq.front().first < i-d) dq.pop_front();
    if(!dq.empty() and chmax(ma, x-dq.front().second)) {
      fb = P(dq.front().first, i);
    }
    while(!dq.empty() and dq.back().second > x) dq.pop_back();
    dq.emplace_back(i, x);
  }
  if(!ma) {
    cout << 0 << endl;
  }
  else {
    cout << (ll)ma*k << endl;
    cout << fb << endl;
  }
}