#include <fstream>
#include <deque>
#define NM 500003
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int i,n,k,fr,bk,max1,in,sf,j;
int a[NM];
deque <int> dq;
int main()
{
    f>>n>>k;
    for(i=1;i<=n;i++)  f>>a[i];
    max1=-30003;
    for(i=1;i<=n;i++){
        while(!dq.empty()&&a[i]<=a[dq.back()]) dq.pop_back();
        dq.push_back(i);
        if(i-k==dq.front()) dq.pop_front();
        if(i>=k&&max1<a[dq.front()]){
            max1=a[dq.front()];
            in=i-k+1;
            sf=i;
        }
    }
    g<<in<<' '<<sf<<' '<<max1<<'\n';
    return 0;
}