#include <cstdio>
const int MAXN = 500005;
const int MINVAL = -30005;
int A[MAXN], Deque[MAXN],n,k;
int s = MINVAL, spos, fpos;
int main()
{
    freopen("secventa.in", "r", stdin);
    freopen("secventa.out", "w", stdout);
    scanf("%d %d", &n, &k);
    for(int i = 1; i <= n; ++i)
        scanf("%d", A+i);
    int Front = 1, Back = 0;
    for(int i = 1; i <= n; i++){
        while(Front <= Back && A[i] <= A[Deque[Back]]) Back--;
        Deque[++Back] = i;
        if(Deque[Front] <= i-k)Front++;
        if(i >= k){
            if(A[Deque[Front]] > s){
                spos = Deque[Front];
                s = A[Deque[Front]];
            }
        }
    }
    if(spos + k > n)    spos = n - k;
    printf("%d %d %d", spos+1,spos+k, s);
    return 0;
}