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

struct Nod {
	int val, poz;
};

Nod make_nod(int val, int poz)
{
	Nod p;
	p.val = val;
	p.poz = poz;
	return p;
}

int main()
{
	ifstream fin("secventa.in");
	ofstream fout("secventa.out");
	deque<Nod> d;
	int n, k, i, current, base, last;
	fin >> n >> k;
	for(i = 0; i < k; i++)
	{
		fin >> current;
		while(!d.empty() && current <= d.back().val)
		{
			d.pop_back();
		}
		d.push_back(make_nod(current, i));
	}
	base = d.front().val;
	last = d.back().poz;
	for(i = k; i < n; i++)
	{
		fin >> current;
		while(!d.empty() && current <= d.back().val)
		{
			d.pop_back();
		}
		d.push_back(make_nod(current, i));
		while(d.front().poz <= i-k)
		{
			d.pop_front();
		}
		if(base < d.front().val)
		{
			base = d.front().val;
			last = d.back().poz;
		}
	}
	fout << last - k + 2 << " " << last + 1 << " " << base << endl;
	return 0;
}