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