#include <bits/stdc++.h>

using namespace std;

ifstream f("secventa.in");
ofstream g("secventa.out");

deque <pair <int, int>> Q;
int N, K, x, mx, pz1, pz2;

int main(){

	f >> N >> K;
	for(int i = 1;i <= K;i++){
		f >> x;
		if(!Q.empty() && Q.back().first > x)
			Q.pop_back();
		Q.emplace_back(x, i);
	}

	int st = 1, dr = K, answ = Q.front().first;
	
	for(int i = K + 1;i <= N;i++){
		f >> x;
		if(!Q.empty() && Q.front().second == i - K)
			Q.pop_front();

		while(!Q.empty() && Q.back().first > x)
			Q.pop_back();

		Q.emplace_back(x, i);
		if(Q.front().first > answ)
			answ = Q.front().first, st = i - K + 1, dr = i;
	}

	g << st << " " << dr << " " << answ;
}