#include <fstream>
#include <climits>
#include <deque>

using namespace std;

ifstream fin("secventa.in");
ofstream fout("secventa.out");

const int N=5e5+2;

int n,k,i,st,dr;
int v[N],maxi;

deque <int> dq;

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

    maxi=-INT_MAX;
    for(i=1; i<=n; i++)
    {
        while(!dq.empty() && dq.back()<i-k+1)
            dq.pop_back();
        while(!dq.empty() && v[dq.front()]>v[i])
            dq.pop_front();
        dq.push_front(i);
        if(i>=k && v[dq.back()]>maxi)
        {
            maxi=v[dq.back()];
            st=i-k+1;
            dr=i;
        }
    }
    fout<<st<<' '<<dr<<' '<<maxi<<'\n';
    return 0;
}