#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int n, k, s;
int v[500001];
deque<int> dq;
int sf, Max = -1e5;
int main() {
	f >> n >> k;
	for (int i = 1; i <= n; i++)
		f >> v[i];
	for (int i = 1; i <= n; i++) {
		while (!dq.empty() && v[i] <= v[dq.back()])
			dq.pop_back();
		dq.push_back(i);

		if (dq.front() == i-k)
			dq.pop_front();

		if (i >= k) {
			if (Max < v[dq.front()]) {
				sf = i;
				Max = v[dq.front()];
			}
		}
	}
	g << sf - k + 1 << ' ' << sf << ' ' << Max;
	return 0;
}