#include <fstream>
#include <vector>
#include <deque>

using namespace std;

ifstream cin("secventa.in");
ofstream cout("secventa.out");

int main() {
	int n, k; cin >> n >> k;
	vector<int> v(n);

	for (int i = 0; i < n; i++) {
		cin >> v[i];
	}

	deque<pair<int, int>> deq;
	for (int i = 0; i < k; i++) {
		while (!deq.empty() && deq.back().first >= v[i]) {
			deq.pop_back();
		}
		deq.push_back({v[i], i});
	}

	int st = 0, dr = k - 1, max = deq.front().first;
	for (int i = k; i < n; i++) {
		if (deq.front().second == i - k) {
			deq.pop_front();
		}
		while (!deq.empty() && deq.back().first >= v[i]) {
			deq.pop_back();
		}
		deq.push_back({v[i], i});

		if (deq.front().first > max) {
			max = deq.front().first;
			dr = i;
			st = i - k + 1;
		}
	}

	cout << st + 1 << " " << dr + 1 << " " << max << "\n";
	return 0;
}