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

using namespace std;

const int MAX = 500000;
int N, K, V[MAX];

int main() {
	ifstream f("secventa.in");
	ofstream g("secventa.out");
	
	f >> N >> K;
	deque<int> deque;
	int min = -30000;
	int end = 0;
	for(int i = 1; i <= N ; i++) {
		f >> V[i];
		int newStart = start;
		if(!(deque.empty()) && deque.front() < i - K) {
			deque.pop_front();
			newStart = deque.front();
		}
		while(!(deque.empty()) && V[deque.back()] >= V[i]) {
			deque.pop_back();
		}
		deque.push_back(i);

		if(i >= K && min < V[deque.front()]) {
			min = V[deque.front()];
			end = i;
		}
	}
	g<<end-K+1<<" "<<end<<" "<<min;
	return 0;
}