#include <bits/stdc++.h>

using namespace std;

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

int n, a[500005], k, coada[500005], f = 1, b;
long long maxim = -(1 << 30), dr;


int main()
{
    fin >> n >> k;
    for (int i = 1; i <= n; ++i)
    {
        fin >> a[i];
    }
    for (int i = 1; i <= n; ++i)
    {
        while (f <= b && a[i] < a[coada[b]]) --b;
        coada[++b] = i;
        if (i > k && f <= b)
        {
            if (coada[f] == i - k) ++f;
        }
        if (i >= k)
        {
            if (f <= b > 0)
                if (a[coada[f]] > maxim)
                    maxim = a[coada[f]], dr = i;
        }
    }
    fout << dr - k + 1 << " " << dr << " " << maxim;
    return 0;
}