#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>

#include <functional>
#include <cassert>

typedef long long ll;
using namespace std;

#define debug(x) cerr << #x << " = " << (x) << endl;


#define mod 1000000007 //1e9+7(prime number)
#define INF 1000000000 //1e9
#define LLINF 2000000000000000000LL //2e18
#define SIZE 100010

int main(){
  int n,d,k;
  int x[SIZE];

  scanf("%d%d%d",&n,&d,&k);

  priority_queue<pair<int,int > > pq;

  int ans = -1;
  int p,q;
  
  for(int i=0;i<n;i++){
    scanf("%d",x+i);

    while(pq.size() && pq.top().second < i-d){
      pq.pop();
    }

    if(pq.size() && ans < x[i] + pq.top().first){
      ans = x[i] + pq.top().first;
      p = pq.top().second;
      q = i;
    }

    pq.push({-x[i],i});
  }

  if(ans <= 0){
    puts("0");
  }else{
    printf("%lld\n%d %d\n",(ll)ans*k,p,q);
  }
  
  return 0;
}