#include <cstdio>
#include <deque>
using namespace std;
int v[5000001],s,i,n,k,mare=-10000000,st,dr,dist;
deque <int> d;
int main()
{
    freopen("secventa.in","r",stdin);
    freopen("secventa.out","w",stdout);
    scanf("%d%d",&n,&k);
    for(i=1;i<=n;++i) scanf("%d",&v[i]);
    d[0]=1;
    for(i=2;i<=n;++i)
    {
        while(!d.empty()&&v[i]<=v[d[d.size()-1]]) d.pop_back();
        d.push_back(i);
        while(!d.empty()&&i-d[0]>=k) d.pop_front();
        if(v[d[0]]>mare&&i>=k)
        {
            mare=v[d[0]];
            dr=i;
        }
    }
    printf("%d %d %d",dr-k+1,dr,mare);
    return 0;
}