#include <fstream>

using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int a[5100000],n,ok,q,i,p=1,k,u,d[5100000];
long long e=-100000;
int main()
{
    f>>n>>k;
    for (i=1;i<=n;i++)
      f>>a[i];
    for (i=1;i<=n;i++)
     {
         while (p<=u && a[i]<=a[d[u]])u--;
         d[++u]=i;
         if (d[p]==i-k)p++;
         if (i>=k && a[d[p]]>e)
         {
             e=a[d[p]];
             q=d[p];
         }

     }
     if (q+k-1<=n)
      for (i=q;i<=q+k-1;i++)
       if (a[i]<e)ok=1;
       g<<q<<'\n';
       if (ok)
     g<<q-k+1<<" "<<q<<" "<<e;
     else
     g<<q<<" "<<q+k-1<<" "<<e;
    f.close();
    g.close();
}