#include<deque>
#include<cstdio>
#include<fstream>

using namespace std;

int n,k;
int v[500001];

int inline cauta (int st,int dr){
	
	int min=1<<30;
	for(;st<=dr;++st)
	if(v[st]<min)
	min=v[st];
	
	return min;}

int main (){
	
	ifstream in ("secventa.in");
	in>>n>>k;
	for(int i=1;i<=n;++i)
	in>>v[i];
	in.close ();
	
	int st=1,dr=n;
	while(st+k<=dr){
		if(v[st]<v[dr])
		++st;
		else
		if(v[st]>v[dr])
		--dr;
		}
		
	freopen ("secventa.out","w",stdout);
	printf ("%d %d %d\n",st,dr,cauta(st,dr));

	
	return 0;}