#include<stdio.h>
int dq[1<<19],v[1<<19],k,dr=-1,st=0,n,i;
long long max;
inline void stanga(int i)
{
    if(i-dq[st]==k)
        ++st;
}
void dreapta(int i)
{
    while(st<=dr&& v[dq[dr]]>=v[i])
        --dr;
    dq[++dr]=i;
}


int main()
{
	freopen("secventa.in","r",stdin);
	freopen("secventa.out","w",stdout);
	scanf("%d%d",&n,&k);
	for(i=1;i<=n;++i)
		scanf("%d",&v[i]);
	for(i=1;i<k;++i)
		dreapta(i);
	int stm,drm;
	for(i=k;i<=n;++i)
	{
		stanga(i);
		dreapta(i);
		if(v[dq[st]]>max) 
		{ 
			stm=i-k+1;
			drm=i;
			max=v[dq[st]];
		}
	}
	printf("%d %d %d",stm,drm,max);
	return 0;
}