#include<bits/stdc++.h>

#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fi first
#define se second
#define sz size
#define pb push_back
#define mp make_pair
#define bg begin
#define all(x) x.begin(),x.end()
using namespace std;

#define int long long

const int maxn = 500003;
const int maxk = 1003;

int a[maxn];
deque<int> deq;
int n,k;

int beggining = -1,ending = -1;

void pushTo(int x){

	if(deq.empty()){
			deq.push_back(x);
		}
		else{
			if(deq.back() <= x){
				deq.push_back(x);
			}
			else{
				while(!deq.empty() && deq.back() > x){
					deq.pop_back();
				}
				deq.push_back(x);
			}
		}

}

int32_t main(){

	// #ifndef ONLINE_JUDGE
	// freopen("secventa.in","r",stdin);
	// freopen("secventa.out","w",stdout);
	// #endif
	ifstream fin("secventa.in");
	ofstream fout("secventa.out");
	ios_base::sync_with_stdio(false);

	fin >> n >> k;
	for(int i=0;i<n;i++){
		fin >> a[i];
	}
	for(int i=0;i<k;i++){
		pushTo(a[i]);
	}
	int maxime = deq.front();
	for(int i=k;i<n;i++){
		if(deq.front() == a[i-k]){
			deq.pop_front();
		}
		pushTo(a[i]);
		if(maxime < deq.front()){
			maxime = deq.front();
			beggining = i-k+1;
			ending = i;
		}
	}
	fout << beggining+1 << ' ' << ending+1 << ' ' << maxime << '\n';

	return 0;
}