#include <cstdio>
#include <queue>
using namespace std;
const int Nmax = 5000001;
int n, k, x, i, j, sign, maxmin=-30001, u, Deque[Nmax], A[Nmax];
char s[10000005];
deque <int> D;
int main()
{   freopen("deque.in", "r", stdin); freopen("deque.out", "w", stdout);
    scanf("%d %d ", &n, &k);
    fgets(s,10000005,stdin); // citire parsata a elementelor sirului A
    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(int i=1; i<=n; ++i)
    {   while(!D.empty() &&  A[i] <= A[D.back()]) D.pop_back();
        D.push_back(i);
        if(D.front() <= i-k) D.pop_front();
        if(i>=k && A[D.front()]>maxmin)
            {maxmin=A[D.front()]; u=i;}
    }
    printf("%d %d %d\n", u-k+1, u, maxmin);
    return 0;
}