#include<iostream> 
#include<cstdio>
#define ls (u<<1)
#define rs (u<<1|1)
using namespace std;
const int MAXN=100010;
int x[MAXN],w[MAXN<<2];
void pushup(int u)
{
    w[u]=max(w[ls],w[rs]);
}
void build(int u,int l,int r) 
{
	if(l==r)
	{
		w[u]=x[l];
		return;
	}
	int mid=l+r>>1;
	build(ls,l,mid);build(rs,mid+1,r);
	pushup(u);
}
int qry(int u,int l,int r,int ql,int qr)
{
    if(ql<=l&&r<=qr)return w[u];
    int mid=l+r>>1;
    int res=-1;
    if(ql<=mid)res=max(res,qry(ls,l,mid,ql,qr));
    if(qr>mid)res=max(res,qry(rs,mid+1,r,ql,qr));
    return res;
}
int main()
{
//    freopen("stock.in","r",stdin);
//    freopen("stock.out","w",stdout);
    int N,D,K;scanf("%d%d%d",&N,&D,&K);
    for(int i=1;i<=N;++i)scanf("%d",&x[i]);
    int f=1;
    for(int i=1;i<N;++i)
    {
        if(x[i]>=x[i+1])continue;
        else
        {
            f=0;
            break;
        }
    }
    if(f==1)printf("0");
    else
    {
        int ansb=0,anse=0,ans=0;
        build(1,1,N);
        for(int i=1;i<=N;++i)
        {
            int b=i+1,e=i+D>N?N:i+D;
            int k=qry(1,1,N,b,e);
            int curans=k-x[i];
            if((curans>ans)||(curans==ans&&b<ansb)){ansb=i;anse=k;ans=curans;}
        }
        printf("%lld\n",(long long)ans*K);
        int anss=0;
        for(int i=ansb+1;i<=ansb+D;++i)
        {
            if(x[i]==anse)
            {
                anss=i;
                break;
            }
        }
//        if(anss==0)anss=N;
        printf("%d %d",ansb-1,anss-1);
    }
    return 0;
}