#include "bits/stdc++.h"
using namespace std;

#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cout<<" "<<v[i]; cout<<endl

typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
const int inf = 1000000001;
const ll INF = 1e18 * 2;
#define MOD 1000000007
#define mod 1000000009
#define pi 3.14159265358979323846
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };

int main() {
	int n, d, k, i, j;
	cin >> n >> d >> k;
	vi x(n);
	for (i = 0; i < n; i++) {
		cin >> x[i];
	}
	ll ans = 0;
	ll buyd, selld;
	deque<int> dq;
	for (i = 0; i <= d; i++) {
		while (!dq.empty()){
			if (dq[dq.size() - 1] < x[i]) {
				dq.pop_back();
			}
			else {
				break;
			}
		}
		dq.push_back(i);
	}
	for (i = 0; i < n; i++) {
		if (ans < (x[dq[0]] - x[i])*k) {
			ans = (x[dq[0]] - x[i])*k;
			buyd = i;
			selld = dq[0];
		}
		if (i + d + 1 < n) {
			while (!dq.empty()) {
				if (dq[dq.size() - 1] < x[i + d + 1]) {
					dq.pop_back();
				}
				else {
					break;
				}
			}
		}
		dq.push_back(i + d + 1);
		while (!dq.empty()) {
			if (dq[0] <= i) {
				dq.pop_front();
			}
		}
	}
	cout << ans << endl;
	if (ans) {
		cout << buyd << " " << selld << endl;
	}
}