#include <iostream>
#include <fstream>
#define maxn 500050

using namespace std;

ifstream f("secventa.in");
ofstream g("secventa.out");

int v[maxn], d[maxn], maxim = -1, i, n, k, u, p, a, b;

int main()
{
	f >> n >> k;
	for (i = 1; i <= n; i++)
		f >> v[i];
	p = 1;
	u = 1;
	d[u] = 1;
	for (i = 2; i <= n; i++)
	{
		while (v[i] <= v[d[u]] && p <= u)
			u--;
		d[++u] = i;
		if (i - d[p] == k)
			p++;
		if (i >= k)
		{
			if (maxim < v[d[p]])
			{
				maxim = v[d[p]];
				a = d[p];
				b = d[u];
			}
		}
	}
	g << a << " " << b << " " << maxim;
	return 0;
}