#include <iostream>
#include <cstdio>
#include <deque>

using namespace std;

const int NMax = 500005;
int N, K;
deque < int > dq;
int v[NMax];
/*
push_front
pop_front
push_back
pop_back
*/

void Read()
{
    scanf("%d %d", &N, &K);

    for(int i=1; i<=N; ++i)
        scanf("%d", &v[i]);
}

int main()
{
    freopen("secventa.in", "r", stdin);
    freopen("secventa.out", "w", stdout);

    Read();

    dq.push_back(1);
    int maxi = -30005;
    int ind_min = 0;
    for(int i=2; i<=N; ++i)
    {
        if(dq.front() == i-K)
            dq.pop_front();

        while(!dq.empty() && v[dq.back()] > v[i])
        {
            dq.pop_back();
        }

        dq.push_back(i);

        if(i>=K)
        {
            if(maxi < v[dq.front()])
            {
                maxi = v[dq.front()];
                ind_min = dq.front();
            }
        }
    }

    cout << ind_min << " " << ind_min + K -1 << " " << maxi;

    return 0;
}