#include <cstdio>
#include <deque>
#include <algorithm>
using namespace std;

const int INF = (int)2e9;

int main() {
	freopen("secventa.in", "r", stdin);
	freopen("secventa.out", "w", stdout);
	deque<int> d;
	int n, k;
	scanf("%d %d", &n, &k);
	int a[n+1];
	for(int i=1;i<=n;i++) 
		scanf("%d", &a[i]);
	int ans = -INF, st=1;
	for(int i=1;i<=k;i++) {
		while(!d.empty() && a[i]<=a[d.back()])
			d.pop_back();
		d.push_back(i);
	}
	ans = a[d.front()];
	for(int i=k+1;i<=n;i++) {
		if(d.front() == i-k)
			d.pop_front();
		while(!d.empty() && a[i]<=a[d.back()])
			d.pop_back();
		d.push_back(i);
		if(ans<a[d.front()]) {
			ans = a[d.front()];
			st = i-k+1;
		}	
	}
	printf("%d %d %d", st, st+k-1, ans);
	return 0;
}