#include <bits/stdc++.h>

using namespace std;

typedef long long ll;


signed main() {
  freopen("secventa.in","r",stdin);
  freopen("secventa.out","w",stdout);
  int n,k;
  cin>>n>>k;
  vector<int>a(n);
  deque<int>dq;
  int sol=-(int)1e9,st,dr;
  for(int i=0;i<n;i++){
    cin>>a[i];
    while(!dq.empty()&&a[i]<=a[dq.back()]){
      dq.pop_back();
    }
    dq.push_back(i);
    while(!dq.empty()&&i-dq.front()+1>k){
      dq.pop_front();
    }
    assert(!dq.empty());
    if (i+1>=k){
      int cur=a[dq.front()];
      if(cur>sol){
        sol=cur;
        st=i-k+1;
        dr=i;
      }
    }
  }
  cout<<st+1<<" "<<dr+1<<" "<<sol<<"\n";
  return 0;
}