#include<cstdio>
#include<deque>
using namespace std;
int i,n,k,maxim,x,imax;
int v[500005];
deque<int> q;
int main()
{
    freopen("secventa.in","r",stdin);
    freopen("secventa.out","w",stdout);
    scanf("%d%d",&n,&k);
    maxim=-30005;
    for(i=1;i<=n;i++)
        scanf("%d",&v[i]);
    for(int i=1;i<=n;i++)
    {
        while(!q.empty() && v[i]<v[q.back()])
            q.pop_back();
        q.push_back(i);
        if(i>=k && maxim<v[q.front()])
            maxim=v[q.front()],imax=i-k+1;
        if(q.front()==i+1-k)
            q.pop_front();
    }
    printf("%d %d %d\n",imax,imax+k-1,maxim);
    return 0;
}