#include <bits/stdc++.h>

using namespace std;

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

deque <pair<int,int>> dq;

int main()
{
    int n,k;
    fin >> n >> k;
    int Max = -999999999;
    int dr = 0;
    for (int i=1;i<=n;++i){
        int x;
        fin >> x;
        while (!dq.empty() and i-dq.front().second>=k) dq.pop_front();
        while (!dq.empty() and dq.back().first>=x) dq.pop_back();
        dq.push_back({x,i});
        if (i>=k){
            if (Max<dq.front().first){
                Max = dq.front().first;
                dr = i;
            }
        }
    }
    fout << dr-k+1 << ' ' << dr << ' ' << Max;
    return 0;
}