#include"bits/stdc++.h" using namespace std; #define REP(k,m,n) for(int (k)=(m);(k)<(n);(k)++) #define rep(i,n) REP((i),0,(n)) using ll = long long; using pll = pair; template class SegmentTree { private: using F = function; // モノイド型 int n; // 横幅 F f; // モノイド T e; // モノイド単位元 vector data; public: // init忘れに注意 SegmentTree() {} SegmentTree(F f, T e) :f(f), e(e) {} void init(int n_) { n = 1; while (n < n_)n <<= 1; data.assign(n << 1, e); } void build(const vector& v) { int n_ = v.size(); init(n_); rep(i, n_)data[n + i] = v[i]; for (int i = n - 1; i >= 0; i--) { data[i] = f(data[(i << 1) | 0], data[(i << 1) | 1]); } } void set_val(int idx, T val) { idx += n; data[idx] = val; while (idx >>= 1) { data[idx] = f(data[(idx << 1) | 0], data[(idx << 1) | 1]); } } T query(int a, int b) { // [a,b) T vl = e, vr = e; for (int l = a + n, r = b + n; l < r; l >>= 1, r >>= 1) { if (l & 1)vl = f(vl, data[l++]); // unknown if (r & 1)vr = f(data[--r], vr); // unknown } return f(vl, vr); } }; int main() { ll N, D, K; cin >> N >> D >> K; vectorx(N); rep(i, N) { ll buf; cin >> buf; x[i] = { buf,-i }; } auto f = [](pll a, pll b) {return max(a, b); }; SegmentTree seg(f, { -1ll << 60,-1 }); seg.build(x); ll score = 0, buy = -1, sell = -1; rep(tbuy, N) { auto high = seg.query(tbuy, min(tbuy + D + 1, N)); ll gain = high.first - x[tbuy].first; if (gain > score) { score = gain; buy = tbuy; sell = -high.second; } } cout << score * K << endl; if (score != 0)cout << buy << " " << sell << endl; return 0; }