#include <bits/stdc++.h>

using namespace std;

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

int main() {
    int N, K;
    fin >> N >> K;
    deque<pair<int,int>> Q;
    for(int i = 1; i <= K; ++i) {
        int x;
        fin >> x;
        while(!Q.empty() && Q.back().first > x)
            Q.pop_back();
        Q.emplace_back(x, i);
    }
    int st = 1, dr = K, ans = Q.front().first;
    for(int i = K + 1; i <= N; ++i) {
        int x;
        fin >> x;
        if(!Q.empty() && Q.front().second == i - K)
            Q.pop_front();
        while(!Q.empty() && Q.back().first > x)
            Q.pop_back();
        Q.emplace_back(x, i);
        if(Q.front().first > ans) {
            ans = Q.front().first;
            st = i - K + 1;
            dr = i;
        }
    }
    fout << st << ' ' << dr << ' ' << ans;
}