#include <iostream>
#include <stack>
#include <fstream>

using namespace std;

ifstream f("secventa.in");
ofstream g("secventa.out");

int n, i, k, a[500005], Max, st, dr, p1, p2;

int main()
{
    f >> n >> k;
    Max = -30001;
    for (int i = 1;i <= n;i++){
        f >> a[i];
    }
    for (int i = 1;i <= n;i++){
        int j = i + 1;
        while(a[i] <= a[j] && j <= n)j++;
        int y = i - 1;
        while(a[i] <= a[y] && y >= 1)y--;
        j--;
        y++;
        int nr = j - y + 1;
        if (nr >= k){
            if (a[i] > Max)Max = a[i],p1 = y,p2 = j;
        }
    }
    g << p1 << " " << p2 << " " << Max;
}