#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;

/// smecherie :
const int SZ=(1<<23);

int pointer=SZ;
char buffer[SZ];

char advance()
{
    if(pointer==SZ)
    {
        fread(buffer,1,SZ,stdin);
        pointer=0;
    }
    return buffer[pointer++];
}

int read()
{
    int answer=0;
    char ch=advance();
    while(!isdigit(ch))
        ch=advance();
    while(isdigit(ch))
    {
        answer=answer*10+ch-'0';
        ch=advance();
    }
    return answer;
}
/// END

const int N=500000;

int n,k;
int v[N+5];
int st=1,dr=0,deq[N+5],ma=-(1<<30);

int p1,p2;

int main()
{
    freopen("secventa.in","r",stdin);
    freopen("secventa.out","w",stdout);
    n=read();
    k=read();
    for(int i=1;i<=n;i++)
    {
        v[i]=read();
        if(st<=dr && i-deq[st]+1>k)
            st++;
        while(st<=dr && v[deq[dr]]>=v[i])
            dr--;
        deq[++dr]=i;
        if(i>=k && v[deq[st]]>ma)
        {
            ma=v[deq[st]];
            p1=i-k+1;
            p2=i;
        }
    }
    printf("%d %d %d\n",p1,p2,ma);
    return 0;
}