#include <iostream>
#include <deque>
#include <cstdio>
#include <cstring>
using namespace std;
int n,k,mCit[500001];
char cit[3500001];
deque <int> coada;
int getNumber(int st,int dr)
{
    int nr=0,semn=1;
    if(cit[st]=='-')
    {
        semn=-1;
        st+=1;
    }
    for(int i=st;i<=dr;i++)
    {
        nr=nr*10+(cit[st]-'0');
    }
    return semn*nr;
}
void citParsata()
{
    int l=strlen(cit);
    cit[l]=' ';
    int j=0;
    for(int i=0; i<l; i++)
    {
        int iInitial=i;
        while(cit[i]!=' ')
            i++;
        mCit[++j]=getNumber(iInitial,i-1);
    }
}
void citire()
{
    scanf("%d%d\n",&n,&k);
    gets(cit);
    citParsata();
}
void stergere(int x)
{
    while(!coada.empty()&&mCit[coada.back()]>mCit[x])
        coada.pop_back();
}
void solve()
{
    for(int i=1; i<k; i++)
    {
        stergere(i);
        coada.push_back(i);
    }
    int minim=-0x3f3f3f,iMin;
    for(int i=k; i<=n; i++)
    {
        stergere(i);
        coada.push_back(i);
        if(i-coada.front()==k)
            coada.pop_front();
        if(mCit[coada.front()]>minim)
        {
            minim=mCit[coada.front()];
            iMin=i;
        }
    }
    printf("%d %d %d",iMin-k+1,iMin,minim);
}

int main()
{
    freopen("secventa.in","r",stdin);
    freopen("secventa.out","w",stdout);
    citire();
    solve();

    return 0;
}