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