#include <bits/stdc++.h>

using namespace std;

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

int n,k,v[500010],maxim=-3e5,st,dr;
deque<int> q;
int main()
{
    in>>n>>k;
    for(int i=1;i<=n;i++)
        in>>v[i];
    for(int i=1;i<=n;i++) {
        while(!q.empty() and v[i]<=v[q.back()])
            q.pop_back();
        q.push_back(i);
        while(!q.empty() and i-k>=q.front())
            q.pop_front();
        if(i>=k and v[q.front()]>maxim)
            maxim=v[q.front()],st=i-k+1,dr=i;
    }
    out<<st<<" "<<dr<<" "<<maxim;
    return 0;
}