#include <iostream>
#include <fstream>
#include <deque>

using namespace std;

ifstream fin("secventa.in");
ofstream fout("secventa.out");

constexpr size_t LIM = 500005;
int N, K, i;
short arr[LIM];
deque<int> deq;

struct {
	int max;
	int i, j;
} ans;

int main() {
	fin >> N >> K;
	for (i = 1; i <= N; i++) {
		fin >> arr[i];
		
		while (!deq.empty() && arr[deq.back()] > arr[i])
			deq.pop_back();
		if (!deq.empty() && deq.front() == i - K)
			deq.pop_front();
		deq.push_back(i);

		if (i >= K && ans.max < arr[deq.front()]) {
			ans.max = arr[deq.front()];
			ans.i = i - K + 1;
			ans.j = i;
		}
	}

	fout << ans.i << ' ' << ans.j << ' ' << ans.max;

	fin.close();
	fout.close();
	return 0;
}