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




#ifdef _MSC_VER
inline unsigned int __builtin_clz(unsigned int x) { unsigned long r; _BitScanReverse(&r, x); return 31 - r; }
inline int __lg(int __n) { return sizeof(int) * 8 - 1 - __builtin_clz(__n); }
#endif
template<class T> struct IRMXQ { // by natsugiri
	vector<T> A; vector<vector<int> > M, X; int N;
	IRMXQ() {}
	IRMXQ(const vector<T> &A_) : A(A_) {
		N = A.size(); int LOGN = __lg(N) + 1;
		M.resize(LOGN); X.resize(LOGN);
		for (int i = 0; i<LOGN; i++) { M[i].resize(N); X[i].resize(N); }
		for (int j = 0; j<N; j++) M[0][j] = X[0][j] = j;
		for (int i = 0; i<LOGN - 1; i++) {
			for (int j = 0; j + (1 << i)<N; j++) {
				if (A[M[i][j + (1 << i)]] < A[M[i][j]]) M[i + 1][j] = M[i][j + (1 << i)];
				else M[i + 1][j] = M[i][j];
				if (A[X[i][j]] < A[X[i][j + (1 << i)]]) X[i + 1][j] = X[i][j + (1 << i)];
				else X[i + 1][j] = X[i][j];
			}
		}
	}
	T min_v(int l, int r) { return A[min_i(l, r)]; }
	int min_i(int l, int r) {
		r = min(N, r);
		int d = __lg(r - l);
		if (A[M[d][r - (1 << d)]] < A[M[d][l]]) return M[d][r - (1 << d)];
		else return M[d][l];
	}
	T max_v(int l, int r) { return A[max_i(l, r)]; }
	int max_i(int l, int r) {
		r = min(N, r);
		int d = __lg(r - l);
		if (A[X[d][l]] < A[X[d][r - (1 << d)]]) return X[d][r - (1 << d)];
		else return X[d][l];
	}
};
//-----------------------------------------------------------------
int N, D, K;
int X[101010];
//-----------------------------------------------------------------
int main() {
	cin >> N >> D >> K;
	rep(i, 0, N) cin >> X[i];
	IRMXQ<int> rmq(vector<int>(X, X + N));

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

		int d = b - a;
		if (C < d) {
			C = d;
			L = i;
			R = rmq.max_i(i + 1, i + D + 1);
		}
	}

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

	printf("%lld\n", 1LL * C * K);
	printf("%d %d\n", L, R);
}