#include <bits/stdc++.h>

using namespace std;

deque<pair<int,int>> q;
int n,k,x,y,s,Max=-40000,f,l;
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",&x);
        if(!q.empty()&&q.front().second<i-k+1) q.pop_front();
        while(!q.empty()&&x<=q.back().first) q.pop_back();
        q.push_back({x,i});
        if(i>=k&&q.front().first>Max) Max=q.front().first,f=i-k+1,l=i;
    }
    printf("%d %d %d",f,l,Max);
    return 0;
}