//Include
#include <fstream>
#include <deque>
using namespace std;

//Constante
const int oo = (int)15e8;

//Variabile
ifstream in("secventa.in");
ofstream out("secventa.out");

int n, k;
int curent;
int maxim, Left, Right;

deque<int> d;
deque<int>::iterator it, end;

//Main
int main()
{
	in >> n >> k;
	for(int i=1 ; i<k ; ++i)
	{
		in >> curent;
		d.push_back(curent);
	}
	
	for(int i=k ; i<=n ; ++i)
	{
		in >> curent;
		d.push_back(curent);
		
		int baza = oo;
		end = d.end();
		for(it=d.begin() ; it!=end ; ++it)
			if(*it < baza)
				baza = *it;
		d.pop_front();
		
		if(baza > maxim)
		{
			maxim = baza;
			Right = i;
			Left = Right - k + 1;
		}
	}
	
	out << Left << ' ' << Right << ' ' << maxim;
	
	in.close();
	out.close();
	return 0;
}