#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n, d;
	ll k;
	cin >> n >> d >> k;
	vector<int> x(n);
	deque<int> dq;
	dq.push_back(0);
	ll ans = -1e14;
	int src, dst;
	for (int i = 0; i < n; i++) {
		cin >> x[i];
		if (i == 0) continue;
		ll b = k * (x[i] - x[dq.front()]);
		if (ans < b) {
			ans = b;
			src = dq.front();
			dst = i; 
		}
		if (dq.front() == i - d) dq.pop_front();
		while (!dq.empty() && x[dq.back()] > x[i]) dq.pop_back();
		dq.push_back(i);
	}
	if (ans <= 0) {
		cout << 0 << endl;
		return 0;
	}
	cout << ans << endl;
	cout << src << " " << dst << endl;
	return 0;
}