#include<cstdio>
#include<deque>
using namespace std;
int n,k,i,j,x,semn,sol=1<<31,A;
char a[500005];
deque<pair<int,int> > D;
int main()
{
    freopen("secventa.in","r",stdin);
    freopen("secventa.out","w",stdout);
    scanf("%d%d\n",&n,&k);
    gets(a); j=0;
    for(i=1;i<=n;i++)
    {
        semn=1; x=0;
        while(a[j]==' ') j++;
        if(a[j]=='-') {semn=-1;j++;}
        while(a[j]>='0'&&a[j]<='9') {x=(x*10+a[j]-'0');j++;}
        x*=semn;
        while(D.size()&&x<=D.back().first) D.pop_back();
        D.push_back(make_pair(x,i));
        if(D.front().second==i-k) D.pop_front();
        if(i>=k)
            if(D.front().first>sol)
            {
                sol=D.front().first;
                A=i;
            }
    }
    printf("%d %d %d\n",A-k+1,A,sol);
    return 0;
}