#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
#include <iostream>
#include <set>
#include <deque>
#include <fstream>

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

#define NMAX 500010

deque<pair<int, int>> Q;
int n, x, k, istart, ifinish, maxi = -200000000;
int v[NMAX];

int main()
{
    fin>>n>>k;
    for(int i = 1; i <= n; i++)
        fin>>v[i];
    istart = ifinish = 1;
    for(int i = 1; i <= n; i++)
    {
        while(Q.size() && Q.back().second > v[i])
            Q.pop_back();
        Q.push_back(make_pair(i, v[i]));
        if(Q.front().first == i - k)
              Q.pop_front();
        if(Q.front().second > maxi && i >= k) {
            maxi = Q.front().second;
            istart = i - k + 1;
            ifinish = i;
        }
    }
    fout<<istart<<' '<<ifinish<<' '<<maxi;
    return 0;
}