#include <iostream>
#include <cstdio>
#include <deque>
using namespace std;
int n,k,vCit[500005],sol[3];
deque <int> aux;
void citire()
{
    scanf("%d%d",&n,&k);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&vCit[i]);
    }
}
void comp(int pozMin,int dr)
{
    if(vCit[pozMin]>sol[2])
    {
        sol[0]=dr-k+1;
        sol[1]=dr;
        sol[2]=vCit[pozMin];
    }
}
void solve()
{
    for(int i=1;i<=n;i++)
    {
        while(!aux.empty()&&vCit[aux.back()]>=vCit[i])
        {
            aux.pop_back();
        }
        aux.push_back(i);

        if(aux.front()<i-k+1)
            aux.pop_front();

        if(i>=k)
            comp(aux.front(),i);
    }
    printf("%d %d %d",sol[0],sol[1],sol[2]);
}
int main()
{
    freopen("secventa.in","r",stdin);
    freopen("secventa.out","w",stdout);
    citire();
    solve();
    return 0;
}