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

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

int main()
{
    int n, k;
    in >> n >> k;
    int v[n];
    deque<int> u;
    int maxBaza, index = k;

    for(int i = 0; i < k; i++)
    {
        in >> v[i];
        while(!u.empty() && v[u.back()] >= v[i])
            u.pop_back();
        u.push_back(i);
    }
    maxBaza = v[u.front()];
    for(int i = k; i < n; i++)
    {
        in >> v[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 = v[u.front()];
            index = i;
        }
    }

    if(n == k) out << index - k + 1 << " " << index << " " << maxBaza;
    else out << index - k + 2 << " " << index + 1 << " " << maxBaza;

    return 0;
}