#include<cstdio>
#include<deque>
using namespace std;
deque <int> val;
deque <int> poz;
int v[5000001];
int main()
{
    long long s;
    int i,k,n,nr,valmax,lungmax,l,pozi;
    freopen("secventa.in","r",stdin);
    freopen("secventa.out","w",stdout);
    scanf("%d%d",&n,&k);
    s=0;
    for(i=1;i<=n;i++)
    {
        scanf("%d",&v[i]);
        if(i<=k)
        {
            while(!val.empty()&&v[i]<val.back())
            {
                val.pop_back();
                poz.pop_back();
            }
            val.push_back(v[i]);
            poz.push_back(i);
        }
    }
   // s+=val.front();
    nr=val.front();
    valmax=nr;
    lungmax=k;
    pozi=k;
    l=k;
    for(i=k+1;i<=n;i++)
    {
        while(!val.empty()&&val.back()>v[i])
        {
            poz.pop_back();
            val.pop_back();
        }
        val.push_back(v[i]);
        poz.push_back(i);
        while(!poz.empty()&&poz.back()-poz.front()+1>k)
        {
            poz.pop_front();
            val.pop_front();
        }
        //s+=val.front();
        if(val.front()==nr)
			l++;
		else
		{
			if(nr>valmax)
			{
				lungmax=l;
				valmax=nr;
				pozi=i;
			}
		nr=val.front();
		l=k;
		}
    }
    if(nr>valmax)
			{
				lungmax=l;
				valmax=nr;
				pozi=n;
			}
    printf("%d %d %d",pozi-lungmax+1,pozi,valmax);
    return 0;
}