#include <bits/stdc++.h>
 
using namespace std;
 
#define dim 100000
char buff[dim];
int p = 0;
 
void read(int &nr){
	nr = 0;
	while((buff[p] < '0' || buff[p] > '9') && buff[p] != '-')
		if(++p == dim) 
			fread(buff, 1, dim, stdin), p = 0;
	bool semn = 0;
	if(buff[p] == '-')
		semn = 1;
	if(semn)
		if(++p == dim) 
			fread(buff, 1, dim, stdin), p = 0;
	while(buff[p] >= '0' && buff[p] <= '9'){
		nr = 10 * nr + buff[p] - '0';
		if(++p == dim) 
			fread(buff, 1, dim, stdin), p = 0;
	}
	if(semn)
		nr = -nr;
}
 
int n, k, a[500100], l, r, mx = -123456;
deque <int> dq;
 
int main(){
	freopen("secventa.in", "r", stdin);
	freopen("secventa.out", "w", stdout);
	cin >> n >> k;
	for(int i = 1; i <= n; i++)
		read(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;
		}
	}
	cout << l << ' ' << r << ' ' << mx;
	return 0;
}