import java.util.*;

public class Main {
	public static void main (String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int d = sc.nextInt();
		long k = sc.nextInt();
		int[] arr = new int[n];
		SegmentTree st = new SegmentTree(n);
		for (int i = 0; i < n; i++) {
		    arr[i] = sc.nextInt();
		    st.update(i, arr[i]);
		}
		long max = 0;
		int start = 0;
		int end = 0;
		for (int i = 1; i < n; i++) {
		    long tmp = st.query(Math.max(i - d, 0), i);
		    if (max < arr[i] - tmp) {
		        max = arr[i] - tmp;
		        end = i;
		        for (int j = Math.max(i - d, 0); j < i; j++) {
		            if (arr[j] == tmp) {
		                start = j;
		                break;
		            }
		        }
		    }
		    max = Math.max(max, arr[i] - tmp);
		}
		System.out.println(max * k);
		if (max > 0) {
		    System.out.println(start + " " + end);
		}
	}
}

class SegmentTree {
    static final int INF = Integer.MAX_VALUE;
    int size;
    int base;
    int[] tree;
    
    public SegmentTree(int size) {
        this.size = size;
        base = 1;
        while (base < size) {
            base <<= 1;
        }
        tree = new int[base * 2 - 1];
        Arrays.fill(tree, Integer.MAX_VALUE);
    }
    
    public void update(int idx, int value) {
        updateTree(idx + base - 1, value);
    }
    
    private void updateTree(int idx, int value) {
        tree[idx] = value;
        if (idx == 0) {
            return;
        }
        
        if (idx % 2 == 1) {
            updateTree((idx - 1) / 2, Math.min(value, tree[idx + 1]));
        } else {
            updateTree((idx - 1) / 2, Math.min(value, tree[idx - 1]));
        }
    }
    
    public int query(int min, int max) {
        return query(min, max, 0, 0, base);
    }
    
    public int query(int min, int max, int idx, int left, int right) {
        if (min >= right || max < left) {
            return INF;
        }
        if (min <= left && right - 1 <= max) {
            return tree[idx];
        }
        int x1 = query(min, max, 2 * idx + 1, left, (left + right) / 2);
        int x2 = query(min, max, 2 * idx + 2, (left + right) / 2, right);
        return Math.min(x1, x2);
    }
 }