#include <bits/stdc++.h>

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

class InParser {
private:
        FILE *fin;
        char *buff;
        int sp;

        char read_ch() {
                ++sp;
                if (sp == 4096) {
                        sp = 0;
                        fread (buff, 1, 4096, fin);
                }
                return buff[sp];
        }

public:
        InParser (const char* nume) {
                fin = fopen (nume, "r");
                buff = new char[4096]();
                sp = 4095;
        }

        InParser& operator >> (int &n) {
                char c;
                while (!isdigit (c = read_ch()) && c != '-');
                int sgn = 1;
                if (c == '-') {
                        n = 0;
                        sgn = -1;
                } else {
                        n = c - '0';
                }
                while (isdigit (c = read_ch())) {
                        n = 10 * n + c - '0';
                }
                n *= sgn;
                return *this;
        }

        InParser& operator >> (long long &n) {
                char c;
                n = 0;
                while (!isdigit (c = read_ch()) && c != '-');
                long long sgn = 1;
                if (c == '-') {
                        n = 0;
                        sgn = -1;
                } else {
                        n = c - '0';
                }
                while (isdigit (c = read_ch())) {
                        n = 10 * n + c - '0';
                }
                n *= sgn;
                return *this;
        }
};

const int MV = 5e5 ;

int v[MV + 1] ;

int main() {
        int n, k ;
        InParser in ("secventa.in") ;
        in >> n >> k ;
        for (int i = 1 ; i <= n ; ++ i) {
                in >> v[i] ;
        }
        int bazaMax (-1e9) ;
        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) ;
}