#include<cstdio>
#define N 500001
#include<algorithm>
using namespace std;
int n,k,v[N],p,u,maxim,sf,inc,d[N],num;
char s[N];
void citire()
{
	freopen("secventa.in","r",stdin);
	freopen("secventa.out","w",stdout);
	scanf("%d%d",&n,&k);
	/*fgets(s,N-1,stdin);
	for (int i=0; s[i]&&s[i]!=10; ++i)
	{
		int nr=0;
		int semn=1;
		if (s[i]=='-')
		{
			semn=-1;++i;
		}
		bool ok=false;
		while(s[i]>='0'&&s[i]<='9'&&s[i]&&s[i]!=10)
		{
			nr=nr*10+(s[i]-'0');++i;ok=true;
		}
		if (ok)
		v[++num]=nr*semn;
	}*/
	for (int i=1; i<=k; ++i)
	{
		scanf("%d",&v[i]);
		while (p!=u&&v[i]<=v[d[u-1]])
			--u;
		d[u++]=i;
	}
	maxim=v[d[p]];
	inc=d[p];sf=d[u-1];
	for (int i=k+1; i<=n; ++i)
	{
		scanf("%d",&v[i]);
		int g=i-d[p];
		if (g==k)
			++p;
		while (u!=p&&v[i]<=v[d[u-1]])
			--u;
		d[u++]=i;
		if (maxim<v[d[p]])
		{
			maxim=v[d[p]];
			inc=d[p];
			sf=d[u-1];
		}
	}
	printf("%d %d %d",inc,sf,maxim);
}

int main()
{
	citire();
	
	return 0;
}