#include <bits/stdc++.h>

using namespace std;
struct numar
{
    int poz,val;
};
deque <numar> q;
numar y;
int n,i,x,k,i1,i2,mx=INT_MIN;
int main()
{
    cin>>n>>k;
    for(i=1; i<=n; i++)
    {
        cin>>x;
        y.poz=i,y.val=x;
        while(!q.empty() && q.front().poz<=i-k)
            q.pop_front();
        while(!q.empty() and q.back().val>y.val)
            q.pop_back();
        q.push_back(y);
        if(i>=k)
            if(q.front().val>mx) mx=q.front().val,i1=i-k+1,i2=i;
    }
    cout<<i1<<" "<<i2<<" "<<mx;
}