import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int N, D;
long K;
long[] X;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      D = readInt();
      K = readLong();
      X = new long[N];
      foreach (i; 0 .. N) {
        X[i] = readLong();
      }
      
      Tuple!(long, int, int) ans;
      
      auto q = DList!(Tuple!(long, int))();
      foreach (j; 0 .. N) {
        const t = tuple(X[j], j);
        for (; !q.empty && q.back >= t; q.removeBack) {}
        q.insertBack(t);
        for (; !q.empty && q.front[1] < j - D; q.removeFront) {}
        assert(!q.empty);
        chmin(ans, tuple(-(X[j] - q.front[0]), q.front[1], j));
      }
      
      if (ans[0] == 0) {
        writeln(0);
      } else {
        writeln(-ans[0] * K);
        writeln(ans[1], " ", ans[2]);
      }
    }
  } catch (EOFException e) {
  }
}