#include<fstream>
#include<queue>

#define MAX 500050

using namespace std;

int n, k,v[MAX], sol = -30050;
deque<int> DQ;

int main()
{
    ifstream in("secventa.in");
    ofstream out("secventa.out");
    int i, end;
    in>>n>>k;
    for(i = 1; i <= n; i++)
    {
        in>>v[i];
        while(!DQ.empty() && v[i] <= v[DQ.back()])
            DQ.pop_back();
        DQ.push_back(i);
        if(DQ.front() == i - k)
            DQ.pop_front();
        if(i >= k && v[DQ.front()] > sol)
        {
            sol = v[DQ.front()];
            end = i;
        }
    }
    out<<end - k + 1<<" "<<end<<" "<<sol;
    fclose(stdout);
}