#include <bits/stdc++.h>
using namespace std;
ifstream f("probleme.in");
ofstream g("probleme.out");
deque<int>q;
int v[500005];
int main()
{
    int n,k,poz,mx=-1e9;
    f>>n>>k;
    for(int i=1;i<=n;++i)
        {
            f>>v[i];
            if(q.size() and v[i]<=v[q.back()])q.pop_back();
            if(q.size() and q.front()<=i-k)q.pop_front();
            q.push_back(i);
            if(i>=k and v[q.front()]>mx)mx=v[q.front()],poz=i;

        }
    g<<poz-k+1<<" "<<poz<<" "<<mx;
}