using System;
using System.Collections;
using System.Collections.Generic;
using System.Collections.Specialized;
using System.Text;
using System.Text.RegularExpressions;
using System.Linq;

public class Program
{
    public static void Main(string[] args)
    {
        new Magatro().Solve();
    }
}

class Magatro
{
    private int N, D, K;
    private int[] x;

    private void Scan()
    {
        string[] line = Console.ReadLine().Split(' ');
        N = int.Parse(line[0]);
        D = int.Parse(line[1]);
        K = int.Parse(line[2]);

        x = new int[N];
        for (int i = 0; i < N; i++)
        {
            x[i] = int.Parse(Console.ReadLine());
        }
    }

    public void Solve()
    {
        Scan();

        int[] B = new int[(N + 1000 - 1) / 1000];
        int[] index = new int[(N + 1000 - 1) / 1000];
        int maxleft = -1;
        int maxright = -1;

        for (int i = 0; i < N; i++)
        {
            if (B[i / 1000] < x[i])
            {
                B[i / 1000] = x[i];
                index[i / 1000] = i;
            }
            
        }
        int max = 0;
        for (int i = 0; i < N - 1; i++)
        {
            int right = Math.Min(i + D, N - 1);

            int bleft = i / 1000;
            int bright = right / 1000;
            int m = 0;

            int rightindex = -1;
            for (int j = bleft; j < bright; j++)
            {
                if (m < B[j])
                {
                    m = B[j];
                    rightindex = index[j];
                }
            }

            for (int j = i; j <= right && j % 1000 < 999; j++)
            {
                if (m < x[j])
                {
                    m = x[j];
                    rightindex = j;
                }
            }


            for (int j = right; j >= i && j % 1000 < 999; j--)
            {
                if (m < x[j])
                {
                    m = x[j];
                    rightindex = j;
                }
            }
            if (max < m - x[i])
            {
                maxleft = i;
                maxright = rightindex;
                max = m - x[i];
            }

        }

        Console.WriteLine((long)K * max);
        if (max == 0)
        {
            return;
        }
        Console.WriteLine($"{maxleft} {maxright}");
    }
}