#include <iostream>
#include <cstdio>
#include <deque>
using namespace std;

int v[500005];
deque < int > Q;
int n,k,max1=-500005,indmax;
void citire()
{

    scanf("%d%d",&n,&k);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&v[i]);
    }
    Q.push_front(1);
    for(int i=2;i<=n;i++)
    {
        if(Q.front()==i-k)
            Q.pop_front();
        while(!Q.empty()&&v[i]<=v[Q.back()])
            Q.pop_back();
        Q.push_back(i);
        if(i>=k)
            if(v[Q.front()]>max1)
            {
                max1=v[Q.front()];
                indmax=i;
            }
    }
    printf("%d %d %d",indmax-k+1,indmax,max1);
}
int main()
{
    freopen("secventa.in","r",stdin);
    freopen("secventa.out","w",stdout);
    citire();
    //cout << "Hello world!" << endl;
    return 0;
}