#include<cstdio>
#include<deque>
int n,i,j,k,pr,ba,a[500006];
using namespace std;
deque<int> c;
int main()
{
	freopen("secventa.in","r",stdin);
	freopen("secventa.out","w",stdout);
	scanf("%d %d",&n,&k);
	int max=-999999;
	for (i=1;i<=n;i++) 	scanf("%d",&a[i]);
	for (i=n;i>=1;i--)
	{
		while((!c.empty())&&(a[c.back()]>a[i])) c.pop_back();
		c.push_back(i);
		if (c.front()>=i+k) c.pop_front();
		if ((a[c.front()]>=max)&&(i<=n-k+1)) 
		{
			max=a[c.front()];
			pr=c.back();
		}
	}
	printf("%d %d %d",pr,pr+k-1,max);
	return 0;
}