#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 = INT_MIN;
deque<int> Dq;

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

    for(int i = 1; i <= k; i ++)
    {
        if(Dq.empty())
        {
            Dq.push_back(i);
            if(maxi < A[Dq.front()])
            {
                maxi = A[Dq.front()];
                poz = Dq.front();
            }
        }

        else
        {
            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();
            }
        }
    }

    for(int i = k + 1; i <= n; i ++)
    {
        if(Dq.empty())
        {
            Dq.push_back(i);
            if(maxi < A[Dq.front()])
            {
                maxi = A[Dq.front()];
                poz = Dq.front();
            }
        }

        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, d = 1;
    dr = st = poz;

    for(int i = poz - 1; i >= 1 && d <= k; i --)
        if(A[i] >= A[poz])
            d ++, st = i;
        else
            break;

    for(int i = poz + 1; i <= n && d <= k; i ++)
        if(A[i] >= A[poz])
            d++, dr = i;
        else
            break;

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