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

using namespace std;

long arr[N];

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