#include <iostream>

using namespace std;

#define inf (1 << 30)
#define maxN 500005

int A[maxN], D[maxN];
int sol = - inf, poz, pozf;

int main()
{
	freopen ("secventa.in", "r", stdin);
	freopen ("secventa.out", "w", stdout);
	
	int N, K;
	
	scanf ("%d %d", &N, &K);
	
	int st = 1, dr = 0;	
	
	for (int i = 1; i <= N; ++ i)
	{
		scanf ("%d", &A[i]);
		
		if (st <= dr && D[st] <= i - K) ++ st;
		
		while (st <= dr && A[D[dr]] > A[i]) -- dr;
		
		D[++ dr] = i;
		
		if (i >= K && sol < A[D[st]])
		{
			poz = D[st];
			pozf = i;
			sol = A[D[st]];
		}
	}

	
	printf ("%d %d %d", poz, pozf, sol);
	
	
	return 0;
}