#include <fstream>
#include <deque>
#define NMAX 500001
using namespace std;

int main()
{
	int n, k, v[NMAX], i, baza, start, end, max = - (1<<30);
	deque<int> dq;
	ifstream f("secventa.in");
	f >> n >> k;
	for (i = 1; i <= n; i++)
	{
		f >> v[i];
	}
	f.close();
	dq.push_back(1);
	for (i = 2; i <= n; i++)
	{
		if (dq.size() == k)
		{
			dq.pop_front();
		}
		while (!dq.empty() && v[dq.back()] > v[i])
		{
			dq.pop_back();
		}
		dq.push_back(i);
		if (i >= k)
		{
			baza = dq.front();
			if (v[baza] > max)
			{
				max = v[baza];
				start = i - k + 1;
				end = i;
			}
		}
	}
	ofstream g("secventa.out");
	g << start << " " << end << " " << max;
	g.close();
	return 0;
}