#include <bits/stdc++.h>

using namespace std;

ifstream f("secventa.in");
ofstream g("secventa.out");

int a[500001],n,incp,k,maxim;

deque <int> D;


int main()
{
    f>>n>>k;
    for(int i=1;i<=n;++i)
        f>>a[i];

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

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

        if(a[D.front()]>maxim && D.front()>=i-k+1)
        {
            maxim=a[D.front()];
            incp=D.front();
        }
    }

    int sf=incp;

    while(sf<n)
    {
        if(a[sf]>=a[incp]) sf++;
        else break;
    }

    g<<incp<<" "<<sf<<" "<<a[incp];
    return 0;
}