#include<fstream>
#include<deque>
#define MaxN 500005
#define INF 1>>30
using namespace std;

ifstream fin("secventa.in");
ofstream fout("secventa.out");

deque<int> deq;
int a[MaxN];
int st,dr,n,k,i,Max;

int main()
{	fin>>n>>k;
	for(i=1;i<=n;i++) fin>>a[i];
	for(i=1;i<=n;i++)
	{	while(!deq.empty()&&a[i]<=a[deq.back()]) deq.pop_back();
		deq.push_back(i);
		if(deq.front()==i-k) deq.pop_front();
		if(i>=k&&a[deq.front()]>Max)
		{	Max=a[deq.front()];
			dr=i;
		}
	}
	fout<<dr-k+1<<' '<<dr<<' '<<Max<<'\n';
	return 0;
}