#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;

int main(){
	long long N, D, K;
	

	cin >> N >> D >> K;
	
	long long x[N];
	for (int i=0; i<N; i++) {
		cin >> x[i];
	}

	long long max = 0;
	int max_j, max_k;
	for (int buy=0; buy<N; buy++) {
		for (int sell=buy+1; sell<=buy+D && sell<N; sell++) {
			long long get = (x[sell] - x[buy]);
			if (get > max) {
				max = get;
				max_j = buy;
				max_k = sell;
			}
		}
	}
	cout << K * max << endl;
	if (max != 0) {
		cout << max_j << " " << max_k << endl;
	}
	return 0;
}