#include <bits/stdc++.h>

using namespace std;
const int nmax=500001;
deque<int>c;
int a[nmax],n,mnmax=-LONG_MAX,k;
char sir[nmax*10];
ifstream fin("secventa.in");
ofstream fout("secventa.out");
inline bool Cif(char ch)
{
    return ('0'<=ch && ch<='9');
}
inline void P()
{
    fin.getline(sir,nmax*10);
    int lg=strlen(sir),semn,cnt;
    semn=1;
    cnt=0;
    for(int i=0;i<lg;)
    {
        if(sir[i]=='-')
        {
            semn=-1;
            i++;
        }
        else if(sir[i]==' ')
            i++;
        else
        {
            int nr;
            nr=0;
            while(Cif(sir[i]))
            {
                nr=nr*10+sir[i]-'0';
                i++;
            }
            nr*=semn;
            a[++cnt]=nr;
            semn=1;
        }
    }
}
int main()
{
    int stg,drp;
    fin>>n>>k;
    fin.get();
    P();
    for(int i=1;i<=k;i++)
    {
        int x=a[i];
        while(!c.empty() && a[c.back()]>=x)
            c.pop_back();
        c.push_back(i);
    }
    mnmax=a[c.front()];
    stg=1;
    drp=k;
    for(int i=k+1;i<=n;i++)
    {
        int x=a[i];
        while(!c.empty() && a[c.back()]>=x)
            c.pop_back();
        c.push_back(i);
        if(i-c.front()>=k)
            c.pop_front();
        if(mnmax<a[c.front()])
        {
            mnmax=a[c.front()];
            drp=i;
            stg=i-k+1;
        }
    }
    fout<<stg<<" "<<drp<<" "<<mnmax<<"\n";
    fin.close();
    fout.close();
    return 0;
}