#include <fstream>
#include <deque>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int A[5000010];
deque<pair<int,int>> Deque;
int n,k,maxim = -2000000000,stop;
int main()
{
    fin>>n>>k;
    for(int i = 1; i<=n; i++)
        fin>>A[i];
    for(int i = 1; i<=n; i++)
    {
        while(Deque.size() && Deque.back().first > A[i])
            Deque.pop_back();

        Deque.push_back({A[i],i});

        if(Deque.front().second<=i-k)
            Deque.pop_front();

        if(i>=k&&Deque.front().first>maxim)
        {
            maxim = Deque.front().first;
            stop = i;
        }
    }
    fout<<stop-k+1<<' '<<stop<<' '<<maxim;
    return 0;
}