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

deque <int> deq;
int a[500005];
long long n,i,k,baza,inceput,sfarsit;

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