/*#include <bits/stdc++.h>

using namespace std;
int n,k,c[55][55],a[55][55];
int Cerinta1()
{
    int i,j;
    ///citire
    fin>>i>>j;
    fin>>n>>k;
    for(int i=1;i<=k;i++)
    {

    }
}


int main()
{
    fout<<Cerinta1();

}*/
#include <bits/stdc++.h>

using namespace std;

ifstream fin("secventa.in");
ofstream fout("secventa.out");

deque<short>q;
queue<short>c;

void Push(short x)
{
    c.push(x);
    while(!q.empty()&&q.back()>x)
        q.pop_back();
    q.push_back(x);
}

void Pop()
{
    int x=c.front();
    if(x==q.front()) q.pop_front();
    c.pop();
}

int main()
{
    int n,k,i,st=1,dr;
    short x,maxim=-30005;
    fin>>n>>k;
    k--;
    dr=n;
    for(i=1;i<=k;i++)
    {
        fin>>x;
        Push(x);
    }
     if (maxim<q.front())
        {
            maxim=q.front();
            st=i-k;
            dr=i;
        }
    for(i=i;i<=n;i++)
    {
        fin>>x;
        Push(x);
        if (maxim<q.front())
        {
            maxim=q.front();
            st=i-k;
            dr=i;
        }
        Pop();
    }
    fout<<st<<" "<<dr<<" "<<maxim<<"\n";


    return 0;
}