#include <bits/stdc++.h>

using namespace std;

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

int n, k, a[500001];
deque<int> q;
int st, sf, b;

int main()
{
    fin >> n >> k;
    for (int i = 1; i <= n; i++) {
        fin >> a[i];

        while (!q.empty() && a[i] < a[q.back()]) {
            q.pop_back();
        }
        q.push_back(i);
        if (q.front() <= i-k) {
            q.pop_front();
        }
        if (i >= k) {
            if (a[q.front()] > b) {
                b = a[q.front()];
                st = i-k+1;
                sf = i;
            }
        }
    }
    fout << st << " " << sf << " " << b;
    return 0;
}