#include<cstdio>
#include<deque>
using namespace std;
int v[500005];
int main()
{
    freopen("secventa.in","r",stdin);freopen("secventa.out","w",stdout);
    deque<int>d;int n,k,i,bmax=-2e9,in;
    scanf("%d%d",&n,&k);
    for(i=1;i<=n;++i)
    {
        scanf("%d",&v[i]);
        while(!d.empty()&&v[i]<=v[d.back()])
            d.pop_back();
        d.push_back(i);
        if(i-k==d.front())
            d.pop_front();
        if(i>=k&&v[d.front()]>bmax)
            bmax=v[d.front()],in=i;
    }
    printf("%d %d %d",in-k+1,in,bmax);
}