#include <bits/stdc++.h>

using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int n, k, v[500010], maxim = -2e9, st, dr;
deque<int> dq;

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

    return 0;
}