#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <fstream>
#include <stack>
#include <string>
#include <cstring>
#include <queue>
#include <deque>

using namespace std;

int n, a;
int v[510000];
int ans;
int maximum = -1e9;
int pozitie_start;
int pozitie_final;

int main(){
    cin >> n;
    cin >> a;

    for (int i = 1; i<=n; i++){
        cin >> v[i];
    }

    deque<int> d;

    for (int i = 1; i<=n; i++){
        if (!d.empty() and i-d.front() == a){
            d.pop_front();
        }
        while (!d.empty() and v[i] <= v[d.front()]){
            d.pop_back();
        }
        d.push_back(i);
        if (i>=a){
            if (v[d.front()]> maximum){
                maximum = v[d.front()];
                pozitie_final = i;
                pozitie_start = i-a+1;
            }
        }
    }

    cout << pozitie_start << " " << pozitie_final << " " << maximum;
}