#include <bits/stdc++.h>

using namespace std;

ifstream fin ("secventa.in");
ofstream fout ("secventa.out");

long long n,k,i,mare,pozl=LLONG_MAX,pozr=LLONG_MAX,poz;
int main()
{
    fin >> n >> k;
    vector<long long> v(n+1),st(n+1),dr(n+1);
    stack<long long> s1,s2;
    for(i=1;i<=n;i++)
        fin >> v[i] ;
    for(i=1;i<=n;i++)
        {
            while(!s1.empty() && v[i]<=v[s1.top()])
                s1.pop();
            if(s1.empty())
                st[i]=0;
            else
                st[i]=s1.top();
            s1.push(i);
        }
    for(i=n;i>=1;i--)
        {
            while(!s2.empty() && v[i]<=v[s2.top()])
                s2.pop();
            if(s2.empty())
                dr[i]=-1;
            else
                dr[i]=s2.top();
            s2.push(i);
        }
    for(i=1;i<=n;i++)
        {
            long long l,r;
            l=st[i]+1;
            if(dr[i]==-1)
                r=n;
            else
                r=dr[i]-1;
            if(r-l+1>=k && v[i]>mare)
                {
                    poz=i;
                    pozl=l;
                    mare=v[i];
                    pozr=l+k-1;
                }
            //cout << i << " " << poz << endl ;
            //cout << i << " " << l << " " << r << " " << v[i] << " " << mare << '\n' ;

        }
    //cout << poz ;
    int l=poz;
    while(v[l]>=v[poz] && l>=l+k-1)
        l++;
    fout << l << " " << l+k-2 << " " << mare ;
    return 0;
}