#include <fstream>

using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int a[5100000],n,ok,q,i,ind,p=1,k,u,d[5100000];
long long e=-100000000;
string s;
int next()
{
    int semn=1,nr=0;
    if (s[ind]=='-') semn=-1,ind++;
    while (s[ind]!=' ') nr=nr*10+s[ind]-'0',ind++;
    ind++;
    return semn*nr;
}
int main()
{
    f>>n>>k;
      f.get();
    getline(f,s); s+=' ';
    for (i=1; i<=n; i++) a[i]=next();
    for (i=1;i<=n;i++)
     {
         while (p<=u && a[i]<a[d[u]])u--;
         d[++u]=i;
        while (p<=u && d[p]<=i-k)p++;
         if (i>=k && a[d[p]]>e)
         {
             e=a[d[p]];
             q=i;
         }

     }
     g<<q-k+1<<" "<<q<<" "<<e;


    f.close();
    g.close();
}