#include<cstdio>
#include<algorithm>
#include<deque>
using namespace std;
int comp(int a,int b)
{
    return (a>b);
}
int main()
{
    int i,j,n,k,imax,jmax,bazmax=-30001,min,a;
    deque<int> v,H;
    freopen("secventa.in","r",stdin);
    freopen("secventa.out","w",stdout);
    scanf("%d%d",&n,&k);
    for(i=1;i<=k;i++)
    {
        scanf("%d",&a);
        v.push_back(a);
    }
    H=v;
    make_heap(H.begin(),H.end(),comp);
    bazmax=H.front();
    jmax=k;
    for(i=k+1;i<=n;i++)
    {
        v.pop_front();
        scanf("%d",&a);
        v.push_back(a);
        H=v;
        make_heap(H.begin(),H.end(),comp);
        min=H.front();
        if(min>bazmax) {jmax=i; bazmax=min;}
    }
    imax=jmax-k+1;
    printf("%d %d %d\n",imax,jmax,bazmax);
    return 0;
}