#include <iostream>
#include <deque>
#include <cstdio>
using namespace std;
int n,k,mCit[500001];
deque <int> coada;
void citire()
{
    scanf("%d%d",&n,&k);
    for(int i=1;i<=n;i++)
        scanf("%d",&mCit[i]);
}
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=0,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;
}