#include <cstdio>

using namespace std;

int front=1,back=1,d[500001],v[500001],n,k,minim,pi,pf;
int main()
{
    freopen("secventa.in","r",stdin);
    freopen("secventa.out","w",stdout);
    scanf("%d %d",&n,&k);
    for(int i=1;i<=n;i++)
        scanf("%d",&v[i]);
    for(int i=1;i<=n;i++)
    {
        while(front <= back && v[d[back]]>=v[i])
            back--;
        d[++back]=i;
        if(i-k == d[front])
            front++;
        if(i>=k && minim<v[d[front]])
            {
                minim=v[d[front]];
                pi=i-k+1;
                pf=i;
            }
    }
    printf("%d %d %d",pi,pf,minim);
}