#include <cstdio>
#include<queue>
using namespace std;
typedef pair<int,int> ii;
deque <ii> q;
int a[500005];
int main()
{
    freopen("secventa.in","r",stdin);
    freopen("secventa.out","w",stdout);
    int n,i,k,l,lmax,x,baza,bazmax,a=1,b=1;
    scanf("%d%d",&n,&k);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&x);
        while(!q.empty()&&q.back().first>=x)
            q.pop_back();
        while(!q.empty()&&i-q.front().second+1>k)
            q.pop_front();
        q.push_back(ii(x,i));
        baza=q.front().first;
        if(i>=k)
        {
            if(baza>bazmax||i==k)
            {
                bazmax=baza;
                a=i-k+1;
                b=i;
            }
        }
    }
    printf("%d %d %d",a,b,bazmax);
}