#include <bits/stdc++.h>

using namespace std;
const int nmax=500001;
deque<int>c;
int a[nmax],n,mnmax=-LONG_MAX,k;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int main()
{
    int stg,drp;
    fin>>n>>k;
    for(int i=1;i<=n;i++)
        fin>>a[i];
    for(int i=1;i<=k;i++)
    {
        int x=a[i];
        while(!c.empty() && a[c.back()]>=x)
            c.pop_back();
        c.push_back(i);
    }
    mnmax=a[c.front()];
    stg=1;
    drp=k;
    for(int i=k+1;i<=n;i++)
    {
        int x=a[i];
        while(!c.empty() && a[c.back()]>=x)
            c.pop_back();
        c.push_back(i);
        if(i-c.front()>=k)
            c.pop_front();
        if(mnmax<a[c.front()])
        {
            mnmax=a[c.front()];
            drp=i;
            stg=i-k+1;
        }
    }
    fout<<stg<<" "<<drp<<" "<<mnmax<<"\n";
    fin.close();
    fout.close();
    return 0;
}