/*#include <fstream>
#include <stdio.h>
#include <limits.h>
using namespace std;
ifstream f("secventa.in");
FILE *g=fopen("secventa.out","w");
int n,k,v[500001],deq[500001],maxb=INT_MIN,pi,pf;

int main(void){
	register int i,j;
	
//	fscanf(f,"%d %d",&n,&k);
	f>>n>>k;
	deq[1]=1;
	//fscanf(f,"%d",&v[1]);
	f>>v[1];
	long long sum=0;
	int p=1,u=1;
	for(i=2;i<=n;i++){
		//fscanf(f,"%d",&v[i]);
		f>>v[i];
		while(p<=u && v[deq[u]]>=v[i])
			u--;
		deq[++u]=i;
		if(i-deq[p]==k)
			p++;
		if(i>=k){
			if(v[deq[p]]>maxb){
				maxb=v[deq[p]];
				pf=deq[u];
			}
		}
			
	}
	fprintf(g,"%d %d %d",pf-k+1,pf,maxb);
	return 0;
}*/
#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; 
}