#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)




#define def -INT_MAX/2
template<class V, int NV> class SegTree { // by kmjp
public:
	V comp(V l, V r) { return max(l, r); };

	vector<V> val;
	SegTree() { val = vector<V>(NV * 2, def); }

	V getval(int l, int r) { //[l,r]
		l += NV; r += NV + 1;
		V ret = def;
		while (l < r) {
			if (l & 1) ret = comp(ret, val[l++]);
			if (r & 1) ret = comp(ret, val[--r]);
			l /= 2; r /= 2;
		}
		return ret;
	}
	void update(int i, V v) {
		i += NV;
		val[i] = v;
		while (i>1) i >>= 1, val[i] = comp(val[i * 2], val[i * 2 + 1]);
	}
};
//-----------------------------------------------------------------
int N, D, K;
int X[101010];
SegTree<int, 1 << 20> st;
//-----------------------------------------------------------------
int main() {
	cin >> N >> D >> K;
	rep(i, 0, N) cin >> X[i];
	rep(i, 0, N) st.update(i, X[i]);

	int L = -1, C = 0;
	rep(i, 0, N - 1) {
		int a = X[i];
		int b = st.getval(i + 1, i + D);

		int d = b - a;
		if (C < d) {
			C = d;
			L = i;
		}
	}

	if (L < 0) {
		printf("0\n");
		return 0;
	}

	rep(i, L, N) {
		if (X[i] == X[L] + C) {
			printf("%lld\n", 1LL * C * K);
			printf("%d %d\n", L, i);
			return 0;
		}
	}
}