#include <bits/stdc++.h>

FILE *in = fopen ("secventa.in", "r"), *out = fopen ("secventa.out", "w") ;

const int MV = 5e5 ;

int v[MV + 1] ;

int main() {
        int n, k ;
        fscanf (in, "%d %d", &n, &k) ;
        for (int i = 1 ; i <= n ; ++ i) {
                fscanf (in, "%d", v + i) ;
        }
        int bazaMax (0) ;
        int leftInt (0), rightInt (0) ;
        std::deque<int> dq ;
        for (int i = 1 ; i <= n ; ++ i) {
                while (!dq.empty() && v[i] <= v[dq.back()])
                        { dq.pop_back(); }
                dq.push_back (i);
                while (!dq.empty() && i - k >= dq.front()) {
                        dq.pop_front();
                }
                if (i >= k && v[dq.front()] > bazaMax) {
                        bazaMax = v[dq.front()];
                        leftInt = i - k + 1;
                        rightInt = i;
                }
        }
        fprintf (out, "%d %d %d", leftInt, rightInt, bazaMax) ;
}