#include <cstdio>
#define Nmax 5000010
using namespace std;
int n, k, x, i, j, sign, maxmin=-30001, u, Front=1, Back, Deque[Nmax], A[Nmax];
char s[10000005];
int main()
{   freopen("secventa.in", "r", stdin); freopen("secventa.out", "w", stdout);
    scanf("%d %d ", &n, &k);
    fgets(s,10000005,stdin);
    for(i=1; i<=n; ++i)
    {   sign=1; A[i]=0;
        if(s[j]==' ') j++;
        if(s[j]=='-') {sign=-1; j++;}
        while('0'<=s[j] && s[j]<='9') {A[i]=A[i]*10+s[j]-'0'; j++;}
        A[i] *= sign;
    }
    for(i=1; i<=n; ++i)
     {  // Cat timp elementul curent este mai mic decat ultimul element din deque, eliminam pozitia ultimului element din deque
        while (Front <= Back && A[i] < A[ Deque[Back] ]) Back--;
        Deque[++Back] = i; // Adaugam pozitia elementului curent in deque
        // Daca elementul minim aflat in varful deque-ului coincide cu cel de pe pozita i-K, ii eliminam pozitia din deque, deoarece acesta nu mai conteaza pentru pasii >= i
        if (Deque[Front] <= i-k) Front++;
        //if (i >= k) Sum += A[ Deque[Front]];      // insumam minimul, care se afla in varful deque-ului
        if(i>=k && A[Deque[Front]]>maxmin)
            {maxmin=A[Deque[Front]]; u=i;}
    }
    printf("%d %d %d\n", u-k+1, u, maxmin);
    return 0;
}
/*
#include<cstdio>
#include<utility>
#include<deque>
#include<fstream>
using namespace std;
deque< pair<int,int> > a;
int i,j,n,x,k,imax,jmax,bazmax=-30001,sign;
char s[10000005];
int main()
{
    freopen("secventa.in","r",stdin);
    freopen("secventa.out","w",stdout);#include<cstdio>
#include<utility>
#include<deque>
#include<fstream>
using namespace std;
deque< pair<int,int> > a;
int i,j,n,x,k,imax,jmax,bazmax=-30001,sign;
char s[10000005];
int main()
{ char s[10000005];

    freopen("secventa.in","r",stdin);
    freopen("secventa.out","w",stdout);
    scanf("%d%d\n",&n,&k);
    fgets(s,10000005,stdin); j=0;
    for(i=1;i<=n;i++)
    {
        sign=1; x=0;
        if(s[j]==' ') j++;
        if(s[j]=='-') {sign=-1; j++;}
        while('0'<=s[j] && s[j]<='9') {x=x*10+s[j]-'0'; j++;}
        x=x*sign;
        if(a.empty()) {a.push_back(make_pair(x,i)); continue;}
        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) if(a.front().first>bazmax) {bazmax=a.front().first; jmax=i;}
    }
    imax=jmax-k+1;
    printf("%d %d %d",imax,jmax,bazmax);
    return 0;
}

    scanf("%d%d\n",&n,&k);
    fgets(s,10000005,stdin); j=0;
    for(i=1;i<=n;i++)
    {
        sign=1; x=0;
        if(s[j]==' ') j++;
        if(s[j]=='-') {sign=-1; j++;}
        while('0'<=s[j] && s[j]<='9') {x=x*10+s[j]-'0'; j++;}
        x=x*sign;
        if(a.empty()) {a.push_back(make_pair(x,i)); continue;}
        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) if(a.front().first>bazmax) {bazmax=a.front().first; jmax=i;}
    }
    imax=jmax-k+1;
    printf("%d %d %d",imax,jmax,bazmax);
    return 0;
}

*/