import java.util.*;
public class A {
    public static void main(String[] args){
        int N, D, K, x[];
        long Max;
        Scanner scan = new Scanner(System.in);
        N = scan.nextInt();
        D = scan.nextInt();
        K = scan.nextInt();
        x = new int[N];
        for(int i = 0; i < N; i++){
            x[i] = scan.nextInt();
        }
        Max = (long)x[D] - x[0];
        int j = 0, k = D;
        for(int h = D; h > 0; h--){
            for(int i = 0; i < N - h; i++){
                if(Max <= (x[N - i - 1] - x[N - i - h - 1])){
                    Max = x[N - i - 1] - x[N - i - h - 1];
                    j = N - i - h - 1;
                    k = N - i - 1;
                }
            }
        }
        if(Max > 0){
            System.out.println(Max * K);
            System.out.println(j + " " + k);
        }
        else{
            System.out.println(0);
        }
    }
}