#include<stdio.h>
#include<deque>
using namespace std;

deque<int> v;
deque<int> p;

int s[500002];

int main()
{
    freopen("secventa.in","r",stdin);
    freopen("secventa.out","w",stdout);
    int n,k,x,i,sol,j;

    scanf("%d%d",&n,&k);
    for(i=1;i<=k;++i)
    {
        scanf("%d",&x);
        s[i]=x;
        while(!v.empty()&&x<v.back())
        {
            p.pop_back();
            v.pop_back();
        }
        p.push_back(i);
        v.push_back(x);
    }
    sol=v.front();
    for(i=k+1;i<=n;++i)
    {
        scanf("%d",&x);
        s[i]=x;
        while(!v.empty()&&x<v.back())
        {
            p.pop_back();
            v.pop_back();
        }
        if(!v.empty()&&p.front()==i-k)
        {
            p.pop_front();
            v.pop_front();
        }
        p.push_back(i);
        v.push_back(x);
        if(sol<v.front())
        {
            sol=v.front();
            j=i;
        }
    }
    s[0]=-2000000000;
    while(s[j]>=sol)
        --j;
    ++j;
    printf("%d %d %d\n",j,j+k-1,sol);
    return 0;
}