#include<iostream>
#include<stdio.h>
#include<deque>
#include<algorithm>
using namespace std;
int n,k,i,x,sf,in,Max=-40000;
typedef pair <int,int> p;
deque <p> Q;
int main()
{
	freopen("secventa.in","r",stdin);
	freopen("secventa.out","w",stdout);
	scanf("%d%d",&n,&k);
	for(i=0;i<n;i++)
	{
		scanf("%d",&x);
		while(!Q.empty()&&Q.back().first>x)
			Q.pop_back();
		Q.push_back(make_pair(x,i));
		if(Q.front().second==i-k)
			Q.pop_front();
		if(i+1>=k)
			if(Q.front().first>Max)
			{
				Max=Q.front().first;
				in=i-k+2;
				sf=i+1;
			}
	}
	printf("%d %d %d\n",in,sf,Max);
	return 0;
}