#include <iostream>
#include <cstdio>
#include <deque>
#include <vector>
#include <cstring>
#define NMAX 500005
#define inf 0x3f3f3f3f
using namespace std;

int N,K,M=-inf;
int v[NMAX];
char s[3500000];
deque<int> q;
int start;
int last_min;
int last;
void citire()
{
    scanf("%d%d\n",&N,&K);
    gets(s);
    int l = strlen(s);
    int k = 1;
    int p = 1;
    for(int i=0;i<l;i++)
    {
        if(s[i]==' ')
        {
            v[k]*=p;
            k++;
            p=1;
        }
        else if(s[i]=='-')
        {
            p=-1;
        }
        else
        {
            v[k]=v[k]*10+(s[i]-'0');
        }
    }
}

void adauga(int i)
{
    while(!q.empty()&&v[q.back()]>v[i])
        q.pop_back();
    q.push_back(i);
}

void primul(int i)
{
    if(!q.empty()&&i-q.front()+1>K)
        q.pop_front();
}

void verifica(int i)
{
    int baza=q.front();
    if(M<v[baza])
    {
        M=v[baza];
        start = i-K+1;
    }
}

void init()
{
    for(int i=1;i<=K;i++)
        adauga(i);
        start = 1;
        M=v[q.front()];
}

void rezolva()
{
    for(int i=K+1;i<=N;i++)
    {
        adauga(i);
        primul(i);
        verifica(i);
    }
}

void afisare()
{
    printf("%d %d %d",start,start+K-1,M);
}

int main()
{
    freopen("secventa.in","r",stdin);
    freopen("secventa.out","w",stdout);
    citire();
    init();
    rezolva();
    afisare();
    return 0;
}