#include <cstdio>
using namespace std;

int n, k, dq[500002], a[500002];
int main()
{
    freopen("secventa.in", "r", stdin);
    freopen("secventa.out", "w", stdout);
    scanf("%d%d", &n, &k);
    int Front = 1, Back = 0, st, dr, Sol = -2000000, Last = 1;
    for(int i = 1; i <= n ; ++i){
        scanf("%d", &a[i]);
        while(Front <= Back && a[i] <= a[dq[Back]])
            --Back;
        dq[++Back] = i;
        while(Front < Back && i - dq[Front] >= k) Last = dq[Front++] + 1;
        if(i - Last + 1 >= k){
            if(a[dq[Front]] > Sol){
                Sol = a[dq[Front]];
                st = Last; dr = i;
            }
        }
    }
    printf("%d %d %d", st, dr, Sol);
    return 0;
}