#include<stdio.h>
#include<utility>
#include<deque>
using namespace std;
deque<pair<int,int> > Q;
int n,k,val,ps,us,bs,i;
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<k;i++)
	{
		scanf("%d",&val);
		while(!Q.empty()&&Q.back().first>val)Q.pop_back();
		Q.push_back(make_pair(val,i));
	}
	bs=-30010;
	for(i=k;i<=n;i++)
	{
		scanf("%d",&val);
		while(!Q.empty()&&Q.back().first>val)Q.pop_back();
		Q.push_back(make_pair(val,i));
		if(Q.front().second==i-k)Q.pop_front();
		if(Q.front().first>bs){bs=Q.front().first;us=i;}
	}
	ps=us-k+1;
	printf("%d %d %d\n",ps,us,bs);
}