#include <stdio.h>
#define nmax 500010
#define buffersize 32768
using namespace std;
int k,l,i,j,x,n,aux,rmq[20][nmax],v[nmax],sol,st;
char buffer[buffersize+5];
inline int min(int a,int b) { if (a<b) return a; else return b; }
inline int query(int x,int y)
{
    int aux,d; d=v[y-x+1]; aux=1<<d;
    return min(rmq[d][x],rmq[d][y-aux+1]);
}
void read(int &x)
{
    while ((buffer[l]<'0' || buffer[l]>'9') && buffer[l]!='-') {
        l++;
        if (l==buffersize) {
            l=0; fread(buffer,1,buffersize,stdin);
        }
    }
    int y=1; x=0;
    if (buffer[l]=='-') y=-y,l++;
    if (l==buffersize) {
        l=0; fread(buffer,1,buffersize,stdin);
    }
    while (buffer[l]>='0' && buffer[l]<='9') {
        x=x*10+buffer[l]-48; l++;
        if (l==buffersize) {
            l=0; fread(buffer,1,buffersize,stdin);
        }
    }
}
int main() {
freopen("secventa.in","r",stdin);
freopen("secventa.out","w",stdout);
fread(buffer,1,buffersize,stdin); l=0;
read(n); read(k);
for (i=1;i<=n;i++) read(rmq[0][i]);
for (i=1;1<<i<=n;i++) {
    aux=1<<(i-1);
    for (j=1;j+aux<=n;j++)
        rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+aux]);
}
for (i=2;i<=n;i++) v[i]=v[i/2]+1; sol=-8000000;
for (i=1;i+k-1<=n;i++) {
    x=query(i,i+k-1);
    if (x>sol) { sol=x; st=i; }
}
printf("%d %d %d",st,st+k-1,sol);
return 0;
}