#include <bits/stdc++.h>

using namespace std;

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

const int nmax = 500005;
int n, k, A[nmax], poz, maxi;
deque<int> Dq;

int main()
{
    f >> n >> k;
    for(int i = 1; i <= n; i ++)f >> A[i];

    Dq.push_back(1);

    if(A[1] > A[2])Dq.pop_back();
    Dq.push_back(2);

    while(!Dq.empty() && A[Dq.back()] > A[3])Dq.pop_back();
    Dq.push_back(3);

    maxi = A[Dq.front()];
    poz = Dq.front();

    for(int i = 4; i <= n; i ++)
    {
        if(Dq.empty())Dq.push_back(i);
        else
        {
            while(!Dq.empty() && Dq.front() + k - 1 < i)Dq.pop_front();
            while(!Dq.empty() && A[Dq.back()] > A[i])Dq.pop_back();
            Dq.push_back(i);

            if(maxi < A[Dq.front()])
            {
                maxi = A[Dq.front()];
                poz = Dq.front();
            }
        }
    }

    int dr, st;
    dr = st = poz;

    for(int i = poz; i <= n; i ++)
        if(A[i] >= A[poz])
            dr = i;
        else
            break;

    for(int i = poz; i >= 1; i --)
        if(A[i] >= A[poz])
            st = i;
        else
            break;

    g << st << " " << dr << " " << A[poz];
    return 0;
}