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

int main() {
    fin >> n >> k;
    getline(fin, f);
    getline(fin, f);
    for(int i = 0; i < f.size(); i++) {
        bool semn = 0;
        if(f[i] == ' ') continue;
        j++;
        if(f[i] == '-') { semn = 1; i++; }
        int m = 0;
        while(f[i] >= '0' && f[i] <= '9') {
            m = m * 10 + f[i] - '0';
            i++;
        }
        if(semn) a[j] = -m;
        else a[j] = m;
    }
    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';
}