#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <deque>
#include <tuple>

using namespace std;

int main() {
	int n, d, k;
	cin >> n >> d >> k;
	vector<int> x(n);
	for (int i = 0; i < n; i++) {
		scanf("%d", &x[i]);
	}
	deque<int> q;
	tuple<int, int, int> mx(0, 0, 0);
	for (int i = 0; i < n; i++) {
		while (!q.empty() && i - q.front() > d) {
			q.pop_front();
		}
		while (!q.empty() && x[q.back()] > x[i]) {
			q.pop_back();
		}
		if (!q.empty()) {
			mx = max(mx, make_tuple(x[i] - x[q.front()], -q.front(), -i));
		}
		q.push_back(i);
	}
	int foo, bar, baz;
	tie(foo, bar, baz) = mx;
	if (foo == 0) {
		cout << 0 << endl;
	} else {
		cout << 1LL * foo * k << endl;
		cout << -bar << " " << -baz << endl;
	}
}