#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<math.h>

using namespace std;


int main() {
	int N, D, K;
	int T = 1000;
	cin >> N >> D >> K;
	T = (int)sqrt(N);
	int X[100000], Table[1000], Index[1000];
	for (int i = 0; i < N; i++) {
		cin >> X[i];
		if (Table[i / T] < X[i]) {
			Table[i / T] = X[i];
			Index[i / T] = i;
		}
	}

	int ans = 0;
	int ansL = -1, ansR = -1;

	for (int i = 0; i < N - 1; i++) {
		int right = min(i + D, N - 1);
		int max = 0;
		int r = -1;
		for (int j = i + 1; j <= right && j % T <= T - 1; j++) {
			if (max < X[j]) {
				max = X[j];
				r = j;
			}
		}

		for (int j = i / T + 1; j < right / T; j++) {
			if (max < Table[j]) {
				max = Table[j];
				r = Index[j];
			}
		}

		for (int j = right; j >= i && j % T != T - 1; j--) {
			if (max <= X[j]) {
				max = X[j];
				r = j;
			}
		}

		if (ans < max - X[i]) {
			ans = max - X[i];
			ansL = i;
			ansR = r;
		}
	}

	cout << (long long)ans*K << endl;
	if (ans == 0)return 0;
	cout << ansL << " " << ansR << endl;
}