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

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

const int NMAX = 5e5 + 5;
deque<int> dq;
int v[NMAX], finish, baza;

int main()
{
    int n, k, x, y;
    fin >> n >> k;

    for(int i = 1; i <= n; ++i)
        fin >> v[i];
    
    for(int i = 1; i <= k; ++i)
    {
        while(!dq.empty() && v[i] <= v[dq.back()])
            dq.pop_back();
        dq.push_back(i);
    }
    baza = v[dq.front()];
    finish = k;

    //fout << baza << " " << finish << '\n';

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

        
        
    }
    fout << finish - k + 1 << " " << finish << " " << baza;

    
}