#include <fstream>
#include <deque>

using namespace std;
ifstream in("secventa.in");
ofstream out("secventa.out");
deque<int>q;
const int nmax = 500000;
int mini = -1e9;
int v[nmax + 1];
int st,dr;
int main()
{
    int n,k;
    in>>n>>k;
    for(int i = 1; i <= n; i++)
    {
        in>>v[i];
        while(!q.empty() && v[i] <= v[q.back()])
            q.pop_back();

        q.push_back(i);

        while(q.front() <= i - k)
            q.pop_front();

        if(i >= k)
            if(mini < v[q.front()])
            {
                mini = v[q.front()];
                st = i - k + 1;
                dr = i;
            }
    }
    out<<st<<' '<<dr<<' '<<mini;
    return 0;
}