#include<cstdio>
#include<algorithm>
#include<deque>
#define Nmax 500000
#define Inf 1000000000
using namespace std;
int n,k,i,j,p,q,nr;
deque< int >d;
int v[Nmax];
int main()
{
    freopen("secventa.in","r",stdin);
    freopen("secventa.out","w",stdout);
    scanf("%d %d",&n,&k); nr=-Inf;
    for (i=1;i<=n;i++)
    {
        scanf("%d",&v[i]);
        while ((!d.empty())&&(v[d.back()]>=v[i])) d.pop_back();
        d.push_back(i);
        if (i>=k && v[d.front()]>nr)
        nr=v[d.front()],p=i-k+1,q=i;
        if (i-k+1==d.front()) d.pop_front();
    }
    printf("%d %d %d",p,q,nr);
    return 0;
}