#include<iostream> 
#include<fstream> 
using namespace std; 
int main() 
{int N,K,i=0,j,min,max=-100000,nr=0,m,n=0,p=0; 
ifstream f("secventa.in"); 
ofstream g("secventa.out"); 
f>>N>>K;
m=K;
int v[N];
while(i<N){
	f>>v[i];
	i++;
	if(i==K){
		min=100000;
		n++;
		for(j=nr;j<(m+nr);j++){
			 if(v[j]<min)
			 min=v[j];
		}
		if(min>max){
			max=min;
			p=n;
		}
		K++;
		nr++;
	}
	
}
n=p+m-1;
g<<p<<"\n"<<n<<"\n"<<max;
f.close();
g.close();
return 0;
}