#include <fstream>
#include <queue>
using namespace std;
ifstream fi("secventa.in");
ofstream fo("secventa.out");

int n,k,A[500005];
deque <int> D;
int main()
{
    fi>>n>>k;
    int maxim=-50000,sf=0;
    for (int i=1; i<=n; i++)
        fi>>A[i];

    for (int i=1; i<=n; i++)
    {
        while (!D.empty() && A[D.back()]>=A[i])
            D.pop_back();
        D.push_back(i);

        if (D.front()==i-k)
            D.pop_front();

        if (i>=k)
        {
            if (A[D.front()]>maxim)
                maxim=A[D.front()],sf=i;
        }
    }
    fo<<sf-k+1<<" "<<sf<<" "<<maxim;
    return 0;
}