#include<iostream>

#include <vector>
#include <list>
#include<stack>
#include<queue>
#include<array>

#include <set>
#include<map>

#include<string>
#include<stdlib.h>

#include<algorithm>
#include <functional>
#include<math.h>

#include<fstream>
#include<iomanip>

using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int,int>;

#define FOR(k,m,n) for(ll (k)=(m);(k)<(n);(k)++)
#define REP(i,n) FOR((i),0,(n))
#define WAITING(str) int str;std::cin>>str;
#define DEBUGING(str) cout<<str<<endl

constexpr int INF = (1 << 30);
constexpr ll INFL = (1ll << 60);
constexpr ll MOD = 1000000007;// 10^9+7



//変数
ll N, D, K;
vector<ll> x;

//計算
void calc()
{
	cin >> N >> D >> K;
	x.resize(N);
	REP(i, N) cin >> x[i];

	pair<ll, ll> res;
	ll best = -INF;
	using pll = pair<ll, ll>;
	using pqp = priority_queue<pll, vector<pll>, greater<pll>>;
	pqp pq;
	pq.push({ x[0],0 });

	FOR(i, 1, N) {
		while (pq.top().second < i - D)pq.pop();
		auto benefit = x[i] - pq.top().first;
		if (benefit > best) {
			best = benefit;
			res = { pq.top().second,i };
		}
		pq.push({ x[i],i });
	}
	if (best <= 0)cout << 0 << endl;
	else {
		cout << best * K << endl;
		cout << res.first << " " << res.second << endl;
	}
}
//デバッグ
void debug()
{
	int N;
	cin>>N;
}


//メイン関数
int main()
{
	calc();
	debug();
	
	return 0;
}