#include <bits/stdc++.h>
using namespace std;

#define problem "secventa"
#define NMAX 500005

int v[NMAX];

int main()
{
	freopen(problem ".in", "r", stdin);
	freopen(problem ".out", "w", stdout);
	
	int n, k;
	scanf("%d%d", &n, &k);

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

	int ans = INT_MIN, start;
	deque<int> dq;

	for (int i = 1; i <= n; ++i) {
		while (!dq.empty() && v[dq.back()] >= v[i])
			dq.pop_back();
		while (!dq.empty() && dq.front() <= i - k)
			dq.pop_front();
		dq.push_back(i);
		if (i >= k) {
			ans = max(v[dq.front()], ans);
			start = dq.front();
		}
	}

	printf("%d %d %d\n", start, start + k - 1, ans);
}