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

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> veci;
typedef vector<string> vecs;
//template<class T,class U> using Hash=unordered_map<T,U>;

#define REP(i, a, n) for(ll i = a; i < (ll)n; i++)
#define RREP(i, a, n) for(ll i = n-1; i >= a; i--)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) RREP(i, 0, n)
#define MD 1000000007

template<class T> T read(){T a;cin >> a;return a;}
template<class T> void read(T& a){cin >> a;}
template<class T> void rarr(T a, int n){for(int i = 0; i < n; i++) {cin >> a[i];}}
template<class T> void write(T a){cout << a << endl;}
template<class T> void writes(vector<T> a, const char* c = " "){cout << a[0];for(int i = 1; i < (int)a.size(); i++)cout << c << a[i];cout << endl;;}
void write(double a){cout << fixed << setprecision(12) << a << endl;}
void write(long double a){cout << fixed << setprecision(12) << a << endl;}
template<class T> void warr(T a, int n, const char* c = " "){cout << a[0];for(int i = 1; i < n; i++)cout << c << a[i];cout << endl;}
void split(string s, string delim, veci& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(atoi(s.substr(pos).data()));break;}else {result.push_back(atoi(s.substr(pos, p - pos).data()));}pos = p + delim.size();}}
void split(string s, string delim, vecs& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(s.substr(pos));break;}else {result.push_back(s.substr(pos, p - pos));}pos = p + delim.size();}}
ll gcd(ll a, ll b){while(true){ll k = a % b;if(k == 0)return b;a = b;b = k;}}
ll comb(ll n, ll m){ll p=1;m=min(m,n-m);for(ll i=1;i<=m;i++){p*=n-i+1;p/=i;}return p;}

typedef pair<int, int> my_pair;

int main(void)
{
	int n, d;
	long long k;
	cin >> n >> d >> k;
	vector<my_pair> x(n);
	set<my_pair> st;
	for(int i = 0; i < n; i++) {
		cin >> x[i].first;
		x[i].second = i;
	}
	st.insert(x[0]);
	pair<int, my_pair> res;
	res.first = 0;
	res.second.first = 0;
	res.second.second = 0;
	for(int i = 1; i < n; i++) {
		my_pair xi = x[i];
		my_pair xm = *st.begin();
		pair<int, my_pair> p;
		p.first = xi.first - xm.first;
		p.second.first = xm.second;
		p.second.second = xi.second;
		if(res.first < p.first) {
			res = p;
		}
		if((int)st.size() >= d){
			st.erase(st.find(x[i - d]));
		}
		st.insert(xi);
	}
	if(res.first > 0) {
		cout << res.first * k << endl;
		cout << res.second.first << " " << res.second.second << endl;
	}
	else {
		cout << 0 << endl;
	}
    return 0;
}