#include<cstdio>
const int N=1<<19;
const int MAX= - (1<<15);
int n,k,i,st,dr,a[N],dq[N];
inline void stanga(int i)
{
	if(i-dq[st]==k) st++;
}

inline void dreapta(int i)
{
	while(st<=dr&&a[i]<=a[dq[dr]]) dr--;
	dq[++dr]=i;
}

int main()
{
	freopen("secventa.in","r",stdin);
	freopen("secventa.out","w",stdout);
	
	scanf("%d%d",&n,&k);
	
	for(i=1;i<=n;++i)
		scanf("%d",&a[i]);
	
	st=1;
	dr=0;
	for(i=1;i<k;++i)
		dreapta(i);
	int max=MAX;
	int stm,drm;
	for(i=k;i<=n;++i)
	{
		stanga(i);
		dreapta(i);
		if(a[dq[st]]>max) 
		{ 
			stm=i-k+1;
			drm=i;
			max=a[dq[st]];
		}
	}
	
	printf("%d %d %d",stm,drm,max);
	return 0;
}