#include<cstdio>
#include<queue>
using namespace std;
deque <int> d;
int a[20],n,k,pf,vf;
int main()
{
    freopen("secventa.in","r",stdin);
    freopen("secventa.out","w",stdout);
    scanf("%d %d",&n,&k);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
    }
    for(int i=1;i<=k;i++)
    {
        while(!d.empty() && a[i]<=a[d.back()]) d.pop_back();
        d.push_back(i);
    }
    pf=k;
    vf=a[d.front()];
    for(int i=k+1;i<=n;i++)
    {
        if(d.front()==i-k) d.pop_front();
        while(!d.empty() && a[i]<=a[d.back()]) d.pop_back();
        d.push_back(i);
        if(vf<a[d.front()])
        {
            vf=a[d.front()];
            pf=i;
        }
    }
    printf("%d %d %d\n",pf-k+1,pf,vf);
}