#include <fstream>
#include <iostream>
using namespace std;

int A[500000];
int d[500000];
int n,k,i,back,front;
int maxx = -40000;
int ii,jj;

int main()
{
	ifstream f("secventa.in");
	ofstream g("secventa.out");
	f >> n >> k;
	for (i=1;i<=n;i++)
		f >> A[i];
	i = 1;
	back = 1;
	front = 1;
	d[back] = A[1];
	for (i=2;i<=n;i++)
	{
		while ((front <=back) && (A[i] < A[d[back]]))
			back--;
		d[++back] = i;
		if (((back -front +1) >= k)) front++;
		if (A[d[front]] >= maxx) 
		{
			maxx = A[d[front]];
			ii =d[front];
			jj = d[back];
		}
	}
	g << ii <<" " << jj <<" " << maxx << endl;

	return 0;
}