#include <cstdio>
#include <deque>

const int NMAX = 500005;
int n, k, a[NMAX];

int main() {
	freopen("secventa.in", "r", stdin);
	freopen("secventa.out", "w", stdout);

	scanf("%d %d", &n, &k);
	for (int i = 1; i <= n; i++)
		scanf("%d", &a[i]);

	std::deque<int> d;

	int base_max = -50000;
	std::pair<int, int> range;

	for (int i = 1; i <= n; i++) {
		if (d.front() == i - k)
			d.pop_front();

		while (!d.empty() && a[d.back()] >= a[i])
			d.pop_back();

		d.push_back(i);

		while (!d.empty() && d.front() <= i - k)
			d.pop_front();

		if (i >= k && a[d.front()] > base_max) {
			base_max = a[d.front()];
			range = {d.front(), d.back()};
			range = {i - k + 1, i};
		}
	}

	printf("%d %d %d\n", range.first, range.second, base_max);


	return 0;
}