#include<cstdio>

const int N=1<<19;

int n,k,v[N],dq[N],st=0,dr=-1;

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

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

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