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

int n,k,i,SOL=-30001,end,V[500010],front,Back,deque[500010];
ifstream in("secventa.in");
ofstream out("secventa.out");
void solve();

int main()
{
	solve();
	
	return 0;
}


void solve()
{
	in>>n>>k;
	front=1;Back=0;
	for(i=1;i<=n;i++)
	{
		in>>V[i];
		while(front<=Back && V[i]<V[deque[Back]])
			Back--;
		deque[++Back]=i;
		if(deque[front]==i-k)front++;
		if(i>=k && V[deque[front]]>SOL)
		{
			SOL=V[deque[front]];
			end=i;
		}
	}
	out<<end-k+1<<' '<<end<<' '<<SOL; 
}