#include <fstream>
#include <deque>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int n,k,maxim,p1,p2,A[500009];
deque < int > dq;
int main()
{
    f >> n >> k;
    for(int i=1; i<=n; i++) f >> A[i];
    for(int i=1; i<=n; i++)
    {
        while(!dq.empty() && A[i] <= A[dq.back()]) dq.pop_back();
        dq.push_back(i);
        if(dq.front() == i-k) dq.pop_front();
        if(i >= k && A[dq.front()] > maxim) maxim = A[dq.front()], p1 = i-k+1, p2 = i;
    }
    g << p1 << " " << p2 << " " << maxim << '\n';
    g.close();
    return 0;
}