// yukicoder: No.489 株に挑戦
// 2019.6.26 bal4u

#include <stdio.h>

#if 1
#define gc() getchar_unlocked()
#else
#define gc() getchar()
#endif
int in()
{
	int n = 0, c = gc();
	do n = 10 * n + (c & 0xf), c = gc(); while (c >= '0');
	return n;
}

// 優先度付きキュー
#define MAX 100005
typedef struct { int t, id; } QUE;
QUE que[MAX]; int qsize;

#define PARENT(i) ((i)>>1)
#define LEFT(i)   ((i)<<1)
#define RIGHT(i)  (((i)<<1)+1)

void min_heapify(int i)
{
	int l, r, min;
	QUE qt;

	l = LEFT(i), r = RIGHT(i);
	if (l < qsize && (que[l].t < que[i].t ||
		que[l].t == que[i].t && que[l].id < que[i].id)) min = l; else min = i;
		if (r < qsize && (que[r].t < que[min].t ||
			que[r].t == que[min].t && que[r].id < que[min].id)) min = r;
		if (min != i) {
			qt = que[i]; que[i] = que[min]; que[min] = qt;
			min_heapify(min);
		}
}

void deq()
{
	que[0] = que[--qsize];
	min_heapify(0);
}

void enq(int t, int id)
{
	int i, min;
	QUE qt;

	i = qsize++;
	que[i].t = t, que[i].id = id;
	while (i > 0 && (que[min = PARENT(i)].t > que[i].t ||
		que[min].t == que[i].t && que[min].id > que[i].id)) {
		qt = que[i]; que[i] = que[min]; que[min] = qt;
		i = min;
	}
}

int N, D, K;

int main()
{
	int i, x, b, s, d;

	N = in(), D = in(), K = in();
	d = 0; for (i = 0; i < N; i++) {
		while (qsize) {
			if (i - que[0].id <= D) break;
			deq();
		}
		x = in();
		if (qsize) {
			int v = que[0].t;
			if (x > v && x - v > d) d = x - v, b = que[0].id, s = i;
		}
		enq(x, i);
	}
	if (d == 0) puts("0");
	else printf("%lld\n%d %d\n", (long long)d*K, b, s);
	return 0;
}