#include <bits/stdc++.h>
#define ll long long
using namespace std;
 
//ifstream fin ("secventa.in");
ofstream fout("secventa.out");

ll n, k, ans, dr, mn, j=0, a[500001];
deque<ll> d;
string f;

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;
    }
};

int main() {
    InParser fin("secventa.in");
    fin >> n >> k;
    for(int i = 1; i <= n; i++) fin >> a[i];
    for(int i = 1; i <= n; i++) {
        while(!d.empty() && a[i] <= a[d.back()])
            d.pop_back();
        d.push_back(i);
        if(d.back() - d.front() >= k) d.pop_front();
        if(i >= k) {
            if(a[d.front()] > ans) {
                ans = a[d.front()];
                dr = i;
            }
        }
    }
    fout << dr - k + 1 << ' ' << dr << ' ' << ans << '\n';
}