#include <fstream>
#include <queue>

using namespace std;

ifstream fin("secventa.in");
ofstream fout("secventa.out");

deque<int> Q;
int n, k, v[500005], maxim, st, dr;

int main() {
    fin >> n >> k;
    for(int i = 1; i <= n; i++) {
        fin >> v[i];
        while(!Q.empty() && v[i] <= v[Q.back()]) {
            Q.pop_back();
        }
        Q.push_back(i);
        if(Q.front() <= i - k) {
            Q.pop_front();
        }
        if(i >= k) {
            if(v[Q.front()] > maxim) {
                maxim = v[Q.front()];
                st = Q.front();
                dr = Q.front() + k - 1;
            }
        }
    }
    fout << st << " " << dr << " " << maxim;
    return 0;
}