#include<stdio.h>
#include<set>
using namespace std;
long x[500005],n,k,p,u;
typedef multiset<long> ml;
typedef ml::iterator It;
ml m;
int main()
{freopen("secventa.in","r",stdin);
  scanf("%ld%ld",&n,&k);
  long i,max;
   for(i=1;i<=n;++i)
    scanf("%ld%",&x[i]);
   p=n-k+1;
   u=n;
   It it;
   for(i=n;i>=n-k+1;--i)
	   m.insert(x[i]);
   max=*m.begin();
   for(i=n-k;i>=1;--i)
   {it=m.find(x[i+k]);
    m.erase(it);
	m.insert(x[i]);
	if(*m.begin()>=max)
	{max=*m.begin();
	 p=i;
	 u=i+k-1;
	}
   }
 fclose(stdin);
freopen("secventa.out","w",stdout);
 printf("%ld %ld %ld",p,u,max);
fclose(stdout);
 return 0;
}