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

deque < pair<int, int> >q;

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

int maxi, p1;

int main()
{
	int n, k, a;

	fin >> n >> k;

	p1 = k;

	for (int i = 1; i <= k; ++i)
	{
		fin >> a;
		while (q.size() && q.back().second >= a)
			q.pop_back();
		q.push_back(make_pair(i, a));
	}

	maxi = q.front().second;


	for (int i = k + 1; i <= n; ++i)
	{
		fin >> a;
		while (q.size() && q.back().second >= a)
			q.pop_back();
		while (q.size() && q.front().first <= i - k)
			q.pop_front();
		q.push_back(make_pair(i, a));
		if (q.front().second > maxi)
		{
			maxi = q.front().second;
			p1 = i;
		}
	}

	fout << p1 - k + 1 << " " << p1 << " " << maxi << "\n";
	return 0;
}