#include <cstdio>
#include <fstream>

using namespace std;

#define MAX_N 100005
#define INF 0x3f3f3f3

int A[MAX_N]; 
int N,K,i,j;
int ANSWER;
int in,out,KBAS=-INF;
int minim;

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);
     
     for (i=1; i<=N-K+1; i++)
     {
       for (j=i; j<=i+K-1; j++)
        {
         minim=INF;
         if (A[j]<minim) minim=A[i];
        }
       if (minim>KBAS) { KBAS=minim; in=i; out=i+K-1;}
     }  
     printf("%d %d %d\n",in,out,KBAS);
     return 0;
}