#include <bits/stdc++.h>

using namespace std;

ifstream fin("secventa.in");
ofstream fout("secventa.out");

long long minim(deque<int> d){
    long long mini=1LL*d.back();
    d.pop_back();
    while(!d.empty()){
        if(d.back()<mini)
            mini=1LL*d.back();
        d.pop_back();
    }
    return mini;
}

int main()
{
    long long n,k,s=0,x,nr=0,mini=0,ifinal,jfinal,a[5001];
    deque<int> dfinal;
    deque<int> d;
    fin>>n>>k;
    for(int i=1;i<=n;i++){
        fin>>a[i];
        d.push_back(a[i]);
        if(i>k-1){
            if(i>k)
                d.pop_front();
            int tmp=1LL*minim(d);
            if(mini<tmp){
                mini=tmp;
                ifinal=i-k+1;
                jfinal=i;
            }
        }
    }
    fout<<ifinal<<" "<<jfinal<<" "<<mini;
    return 0;
}