#include<stdio.h>
const int N=5000001;
int d[N],v[N],n,k,st=1,dr,i,max,p;
long long s;

inline void stanga(int i)
{
	if (i-d[st]==k)
		++st;
}

inline void dreapta(int i)
{
	while(st<=dr && v[d[dr]]>=v[i])
		--dr;
}

inline void adauga(int i)
{
	d[++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);
		adauga(i);
	}
	for(;i<=n;++i)
	{
		stanga(i);
		dreapta(i);
		adauga(i);
		if (max<v[d[st]])
		{
			max=v[d[st]];
			p=i;
		}
	}
	printf("%d %d %d\n",max,p-k+1,p);
}