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

int N,K,SOL=-30010,inc,sf,i,V[50010];
deque<int> Q;

void read(),solve();

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

void read()
{
	freopen("secventa.in","r",stdin);
	freopen("secventa.out","w",stdout);
	scanf("%d%d",&N,&K);
}

void solve()
{
	for(i=1;i<=N;i++)
	{
		scanf("%d",&V[i]);
		while(!Q.empty()&& V[i]<=V[Q.back()])Q.pop_back();
		Q.push_back(i);
		if(Q.front()==i-K)Q.pop_front();
		if(i>=K && SOL<V[Q.front()])
		{
			SOL=V[Q.front()];
			sf=i;
			inc=i-K+1;
		}
	}
	
	printf("%d %d %d",inc,sf,SOL);
}