#include<fstream>
#include<deque>
#include<iostream>
using namespace std;


int main(){
    int a[500001];
    deque<int> q;
    int s=-(1<<30),mn=0,i,k,n;
    ifstream fin("secventa.in");
    fin>>n>>k;
    for(i=1;i<=k;++i){
        fin>>a[i];
        while(!q.empty() && a[i]<q.back())
            q.pop_back();
        q.push_back(i);
    }
        s=a[q.front()]; mn=q.front(); cout<<s<<' '<<mn<<'\n';
    for(i=k+1;i<=n;++i){
         fin>>a[i];
         if(q.front()==i-k)
            q.pop_front();

        while(!q.empty() && a[i]<q.back())
            q.pop_back();
        q.push_back(i);

        if(a[q.front()]>s){
        s=a[q.front()]; mn=q.front();
    }
    }
    ofstream fout("secventa.out");
    int kmn=mn+k-1;
    while(a[mn-1]>=s) --mn;
    while(a[kmn-1]>=s && kmn-mn>=k) --kmn;
    fout<<mn<<' '<<kmn<<' '<<s;
    return 0;
}