#include <bits/stdc++.h>

using namespace std;

ifstream fin("secventa.in");
ofstream fout("secventa.out");

deque <int> q;
int a[500003],n,k;

int main()
{
    int i,baza,dr,x;
    fin>>n>>k;
    for(i=1;i<=n;i++)
        fin>>a[i];
    for(i=1;i<=k;i++)
    {
        x=a[i];
        while(!q.empty() && a[q.back()]>=x )
            q.pop_back();
        q.push_back(i);
    }
    baza=a[q.front()];
    dr=k;
    for(i=k+1;i<=n;i++)
    {
        x=a[i];
        while(!q.empty() && a[q.back()]>=x )
            q.pop_back();
        q.push_back(i);
        if(q.front() == i-k)
            q.pop_front();
        if(a[q.front()]>baza)
        {
            baza=a[q.front()];
            dr=i;
        }
    }
    fout<<dr-k+1<<" "<<dr<<" "<<baza;
    return 0;
}