#include<cstdio>
int n,k,st,dr,p1,p2,a[5000001],dq[5000001];
long long max,s;
inline void elimst(int i)
{
	if(i-dq[st]==k)
		++st;
}
void elimdr(int i)
{
	while(st<=dr&&a[dq[dr]]>=a[i])
		--dr;
	dq[++dr]=i;
}
int main()
{
	freopen("secventa.in","r",stdin);
	freopen("secventa.out","w",stdout);
	scanf("%d%d",&n,&k);
	st=dr=1;
	for(int i=1;i<=n;++i)
	{
		scanf("%d",&a[i]);
	}
	dq[1]=1;
	for(int i=2;i<=k;i++)
	{
		elimdr(i);
	}
	s=a[dq[st]]; max=a[dq[st]]; p1=1; p2=k;
	for(int i=k+1;i<=n;++i)
	{
		elimst(i);
		elimdr(i);
		if(a[dq[st]]>max)
		{
			max=a[dq[st]];
			p2=i;
			p1=i-k+1;
		}
	}
	printf("%d %d %lld\n",p1,p2,max);
	return 0;
}