#include <iostream>
#include <cstdio>
#define max_N 500005
#define INITMAX -320000

using namespace std;

int Values[max_N], i, j, K, N, First, Last, x, y, maxim, Deque[max_N];

int main()
{	
	freopen("secventa.in", "r", stdin);
	freopen("secventa.out", "w", stdout);
	scanf("%d %d", &N, &K);
	maxim = INITMAX;
	for(i = 1; i <= N; i ++)
		scanf("%d", &Values[i]);
	
	First = 1, Last = 0;
	for(i = 1; i <= N; i ++)
	{
		while(First <= Last && Values[i] <= Values[Deque[Last]]) Last --;
		Deque[++Last] = i;
		if(Deque[First] == i - K)
			First ++;
		if(i >= K)
			if(Values[Deque[First]] > maxim)
			{
				maxim = Values[Deque[First]];
				x = i - K + 1;
				y = i;
			}
	}
	
	printf("%d ", x);
	printf("%d ", y);
	printf("%d", maxim);
	return 0;
}