#include <iostream>
#include <list>

using namespace std;

struct item {
	int val;
	int pos;
};

int main (void) {	
	freopen("secventa.in", "r", stdin);
	freopen("secventa.out", "w", stdout);
		
	int n, k;
	
	scanf("%d %d", &n, &k);
	int v[n];
	
	for (int i = 0; i < n; ++i) {
		scanf("%d", &v[i]);
	}
	
	list<item> l;
	
	item aux;
	int max = 0, startSol = 0;
	
	for (int i = 0; i < k; ++i) {
		while (!l.empty() && v[i] <= l.back().val) {
			l.pop_back();
		}
		
		aux.val = v[i];
		aux.pos = i;
		l.push_back(aux);
	}
		
		
	max = l.front().val;
	startSol = l.front().pos;
	
	for (int i = 1; i < n; ++i) {		
		while (!l.empty() && v[i] <= l.back().val) {
			l.pop_back();
		}
		
		aux.val = v[i];
		aux.pos = i;
		l.push_back(aux);
		
		if (l.front().pos <= i - k) l.pop_front();
		
		if (l.front().val > max) {
			max = l.front().val;
			startSol = l.front().pos;
		}
	}
	
	while (startSol && v[startSol] >= max) --startSol;
	if (v[startSol] < max) ++startSol;	
	
	cout << startSol + 1 << " " << startSol + k << " " << max;
	
	return 0;
}