#include<cstdio>
using namespace std;

int n,k,i,SOL=-(1<<30),end,V[50010],front,Back,deque[50010];

void read(),solve();

int main()
{
	read();
	solve();
	
	return 0;
}

void read()
{
	freopen("secventa.in","r",stdin);
	freopen("secventa.out","w",stdout);
	scanf("%d%d",&n,&k);
}

void solve()
{
	front=1;Back=0;
	for(i=1;i<=n;i++)
	{
		scanf("%d",&V[i]);
		while(front<=Back && V[i]<V[deque[Back]])
			Back--;
		deque[++Back]=i;
		if(deque[front]==i-k)front++;
		if(i>=k && V[deque[front]]>SOL)
		{
			SOL=V[deque[front]];
			end=i;
		}
	}
	printf("%d %d %d\n",end-k+1,end,SOL);
}