#include <cstdio>
#include <deque>
using namespace std;
deque<int>Q;
int v[500001];
int main()
{
    freopen("secventa.in","r",stdin);
    freopen("secventa.out","w",stdout);
    int n,i,k,maxi=-300000,in=0,sf=0;
    scanf("%d%d",&n,&k);
    for(i=1;i<=n;++i)
    {
        scanf("%d",&v[i]);
        while(Q.size())
        {
            if(Q.front()<i-k+1) Q.pop_front();
            else break;
        }
        while(Q.size())
        {
          if(v[i]<v[Q.back()]) Q.pop_back();
          else break;
        }
        Q.push_back(i);
        if(i>=k&&v[Q.front()]>maxi)
        {
            in=i-k+1;
            sf=i;
            maxi=v[Q.front()];
        }
    }
    printf("%d %d %d",in,sf,maxi);
    //fout<<in<<" "<<sf<<" "<<maxi;
}