#include <iostream>
#include <fstream>
#include <deque>
using namespace std;

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

void read(int* v, int n)
{
    for(int i = 0; i < n; i++)
        in >> v[i];
}

int main()
{
    int n, k;
    in >> n >> k;
    int v[n];
    read(v, n);

    deque<int> u;
    int maxBaza = -30001, index = k;

    for(int i = 0; i < n; i++)
    {
        while(!u.empty() && v[u.back()] >= v[i])
            u.pop_back();
        u.push_back(i);
    }
    for(int i = k; i < n; i++)
    {
        while(!u.empty() && v[u.back()] >= v[i])
            u.pop_back();
        u.push_back(i);
        if(u.front() < i-k)
            u.pop_front();

        if(v[u.front()] > maxBaza)
        {
            maxBaza = u.front();
            index = i;
        }
    }

    out << index - k + 2 << " " << index + 1 << " " << maxBaza;

    return 0;
}