#include <iostream>
#include <fstream>
#include <deque>
#define N 500010

using namespace std;

int main()
{
    ifstream fin("secventa.in");
    ofstream fout("secventa.out");
    int n, k, arr[N], sol=0;
    deque<int> values;
    fin >> n >> k;
    for (int i=0; i<n; i++)
        fin >> arr[i];
    for (int i=0; i<n; i++)
    {
        if (values.empty())
        {
            sol = i;
            values.push_back(i);
        }
        else
        {
            if (arr[values.front()]>arr[sol] && i>=k-1)
                sol = values.front();
            if (values.front()<=i-k)
                values.pop_front();
            while(arr[values.back()]>arr[i])
                values.pop_back();
            values.push_back(i);
        }
    }
    if (arr[values.front()]>arr[sol])
        sol = values.front();
    fout << sol+1 << " " << sol+k << " " << arr[sol];
    return 0;
}