#include <fstream>
#include <deque>
using namespace std;
ifstream cin ("secventa.in");
ofstream cout ("secventa.out");
deque <int> v;
int x[500000];
int main()
{
    long long n,i,j,k,minim,a,suma=0,lmax=0,u=0;
    cin>>n>>k;
    for(i=1; i<=n; i++)
    {
        cin>>x[i];
        while(!v.empty() && v.back()>x[i])
        {
            v.pop_back();
        }
        v.push_back(x[i]);
        if(i>=k)
        {
            if(!v.empty() && x[i-k]==v.front())
            {
                v.pop_front();
            }
            if(v.front()>lmax)
            {
                u=i;
                lmax=v.front();
            }
        }
    }
    for(i=u-k+1;i>=2;i--)
    {
        if(x[i-1]<lmax)
        {
            break;
        }
    }
    for(j=u;j<n;j++)
    {
        if(x[j+1]<lmax)
        {
            break;
        }
    }
    cout<<i<<" "<<j<<" "<<lmax;
    return 0;
}