#include <bits/stdc++.h>
using namespace std;

int N,K,Sol = -100000,L,X;
deque < pair<int,int> > D;

int main()
{
    freopen("secventa.in","r",stdin);
    freopen("secventa.out","w",stdout);

     scanf("%d%d",&N,&K);

      for (int i = 1;i <= N;i++)
      {
          scanf("%d",&X);

           while (!D.empty() && D.back().first > X)
            D.pop_back();

           D.push_back(make_pair(X,i));

           if (i < K) continue;

           if (D.front().second == i - K)
            D.pop_front();

           if (Sol < D.front().first)
               Sol = D.front().first,L = i - K + 1;
      }
      printf("%d %d %d\n",L,L + K - 1,Sol);

    return 0;
}