#include <bits/stdc++.h>

using namespace std;

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

int n, k, a[500100], l, r, mx = -123456;
deque <int> dq;

int main(){
	in >> n >> k;
	for(int i = 1; i <= n; i++)
		in >> a[i];
	for(int i = 1; i <= k; i++){
		while(!dq.empty() && a[i] <= a[dq.back()])
			dq.pop_back();
		dq.push_back(i);
	}
	l = 1; r = k; mx = a[dq.front()];
	for(int i = k + 1; i <= n; i++){
		while(!dq.empty() && a[i] <= a[dq.back()])
			dq.pop_back();
		dq.push_back(i);
		while(dq.front() < i - k + 1)
			dq.pop_front();
		if(a[dq.front()] > mx){
			mx = a[dq.front()];
			r = i;
			l = r - k + 1;
		}
	}
	out << l << ' ' << r << ' ' << mx;
	return 0;
}