#include<deque>
#include<cstdio>
using namespace std;
struct val
{
    int x,y;
};
deque<val>q;
int main()
{
    freopen("secventa.in","r",stdin);
    freopen("secventa.out","w",stdout);
    int n,i,k,x1,max1=0,m2=0;
    val f;
    scanf("%d%d",&n,&k);
    for(i=1;i<=n;i++)
    {
        if(q.front().y==i-k) q.pop_front();
        scanf("%d",&x1);
        while(q.empty()==0&&x1<=q.back().x)
            q.pop_back();
        f.x=x1;
        f.y=i;
        q.push_back(f);
        if(i>=k&&q.front().x>max1)
        {
            max1=q.front().x;
            m2=i;
        }
    }
    printf("%d %d %d",m2-k+1,m2,max1);
    return 0;
}