#include <bits/stdc++.h>

using namespace std;

deque<int>q;
int v[500001];


int main()
{
ifstream cin("secventa.in");
ofstream cout("secventa.out");
    int n,k,a,maxm=0,y=0;

    cin>>n>>k;
    for(int i=0;i<k;i++)
    {
      cin>>v[i];
      while(!q.empty() && v[q.back()]>v[i])
        q.pop_back();
      q.push_back(i);
    }
    maxm=v[q.front()];
   for(int i=k;i<n;i++)
    {
      cin>>v[i];
      if(q.front()<=i-k)
        q.pop_front();
      while(!q.empty() && v[q.back()]>v[i])
        q.pop_back();
      q.push_back(i);
     // cout<<q.front()<<endl;
      if(maxm<v[q.front()])
      {
        maxm=v[q.front()];
        y=i-k+1;
      }
    }
    cout<<y+1<<" "<<y+k<<" "<<maxm;
    //cout<<sum;
    return 0;
}