#include <cstdio>
#include <algorithm>
#include <deque>
using namespace std;
int maxim=-30000,max1,max2;
deque <int> d;
int baze(){
    int baza=30000,s=d.size();
    for(int i=0;i<s;i++){
        if(d[i]<baza){
            baza=d[i];
        }
    }
    return baza;
}
int main()
{
    freopen("secventa.in","r",stdin);
    freopen("secventa.out","w",stdout);
    int n,k,baza,a;
    scanf("%d%d",&n,&k);
    for(int i=1;i<=k;i++){
        scanf("%d",&a);
        d.push_back(a);
    }
    baza=baze();
    maxim=baza;
    max2=k;
    max1=1;
    for(int i=k+1;i<=n;i++){
        scanf("%d",&a);
        d.push_back(a);
        d.pop_front();
        baza=baze();
        if(baza>maxim){
            maxim=baza;
            max2=i;
            max1=i-k+1;
        }
    }
    printf("%d %d %d\n",max1,max2,maxim);
    return 0;
}