#include<iostream>
#include<iomanip>
#include<math.h>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<bitset>
#define INF 1000000000ll
#define MOD 1000000007ll
#define EPS 1e-10
#define REP(i,m) for(long long i=0; i<m; i++)
#define FOR(i,n,m) for(long long i=n; i<m; i++)
#define DUMP(a) for(long long dump=0; dump<(ll)a.size(); dump++) { cout<<a[dump]; if(dump!=(ll)a.size()-1) cout<<" "; else cout<<endl; }
#define ALL(v) v.begin(),v.end()
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef long double ld;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	ll n,d,k;
	cin>>n>>d>>k;
	vector<ll> x(n);
	REP(i,n) cin>>x[i];
	priority_queue<P,vector<P>,greater<P>> q;
	ll ans=0;
	ll a=0,b=0;
	REP(i,n) {
		q.push(P(x[i],i));
		while((q.top()).second<i-d) q.pop();
		if(ans<x[i]-(q.top()).first) {
			ans=x[i]-(q.top()).first;
			a=(q.top()).second;
			b=i;
		}
	}
	if(ans==0) cout<<0<<endl;
	else {
		cout<<ans*k<<endl;
		cout<<a<<" "<<b<<endl;
	}
}