#include<iostream>
#include<string>
#include<vector>
#include<set>
#include<algorithm>
#include<queue>
#include<functional>
#include<numeric>
#include<sstream>
#include<math.h>
#include <iomanip>
#define ll long long
#define PLL pair<ll,ll>
#define VS vector<string>
#define VL vector<ll>
#define VB vector<bool>
#define VPLL vector<pair<ll,ll> >
#define VVL vector<vector<ll> >
#define VVVL vector<vector<vector<ll> > >
#define VVB vector<vector<bool> >
#define rep(i,a) for (ll i=0;i<a;i++)
#define nrep(i,n,a) for (ll i=n;i<a;i++)
#define mrep(i,a) for(ll i=a;i>=0;i--)
#define INF 1000000000000000000
#define PI 3.141592653589793238
#define vmin(vec) *std::min_element(vec.begin(),vec.end())
#define vmax(vec) *std::max_element(vec.begin(),vec.end())
#define vsum(vec) std::accumulate(vec.begin(),vec.end(),0LL)
#define ksort(vec) sort(vec.begin(), vec.end(), greater<ll>())
#define ssort(vec) (vec.begin(),vec.end())
#define VPLLsort(vec) sort(vec.begin(), vec.end(),[](PLL &a, PLL &b){ return a.first < b.first; });
#define LTS(n) to_string(n)
#define STL(str) stoll(str)
using namespace std;

int main() {
	ll n, d, k;
	cin >> n >> d >> k;
	VL x(n); rep(i, n) cin >> x[i];
	ll maxi = -1;
	ll mini_index = 0;
	ll maxi_index = 0;
	PLL ans;
	ans.first = 0;
	ans.second = 0;
	deque<ll> dq;
	dq.push_back(0);
	nrep(i, 1, n){
		if (maxi < x[i] - x[dq.front()] && i - dq.front() <= d){
			maxi = x[i] - x[dq.front()];
			ans.second = i;
			ans.first = dq.front();
		}
		if (dq.front()==i-d){
			dq.pop_front();
		}
		while (!dq.empty() && x[dq.back()]>x[i]) dq.pop_back();
		dq.push_back(i);
	}if (maxi <= 0){
		cout << 0 << endl;
	}
	else{
		mrep(i, ans.first){
			if (ans.second - i>d) break;
			if (x[i] == x[ans.first]) ans.first = i;
		}
		cout << maxi*k << endl;
		cout << ans.first << " " << ans.second << endl;
	}
	return 0;
}