#include <cstdio>
#include <deque>

using namespace std;

int n, k, base = -30005, leftIndex, rightIndex, v[500005];
deque < int > positions;

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

	scanf("%d%d", &n, &k);

	for (int i = 1; i <= n; i++) {
		scanf("%d", &v[i]);
		while (!positions.empty() && v[i] < v[positions.back()]) positions.pop_back();
		positions.push_back(i);

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

		if (i >= k && base < v[positions.front()]) {
			base = v[positions.front()];
			rightIndex = i;
			leftIndex = i - k + 1;
		}
	}

	fclose(in);
	printf("%d %d %d", leftIndex, rightIndex, base);
	fclose(out);

    return 0;
}