#include<cstdio>
#include<utility>
#include<deque>
#include<algorithm>
using namespace std;
int main()
{
	deque< pair<int,int> > a;
	int i,n,x,k,imax,jmax,bazmax=-30001;
    freopen("secventa.in","r",stdin);
    freopen("secventa.out","w",stdout);
    scanf("%d%d",&n,&k);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&x);
        if(a.empty()) a.push_back(make_pair(x,i));
        else
        {
            while((!a.empty())&&(a.back().first>x)) a.pop_back();
            a.push_back(make_pair(x,i));
            while(a.front().second<i-k+1) a.pop_front();
            if(i>=k&&a.front().first>bazmax) {bazmax=a.front().first; jmax=i;}
        }
    }
    imax=jmax-k+1;
    printf("%d %d %d",imax,jmax,bazmax);
    return 0;
}