//0014
#include <cstdio>
#include <cstdlib>

int cit() {
    int ans = 0;
    char c = getchar();
    bool neg = false;
    while (c < '0' || c > '9') {
        if (c == '-') {
            c = getchar();
            neg = true;
            break;
        }
        c = getchar();
    }
    while (c >= '0' && c <= '9') {
        ans = (ans << 3) + (ans << 1) + (c - '0');
        c = getchar();
    }
    return (neg) ? -ans : ans;
}

void afis(int n) {
    int l = 0;
    char c[20];
    if (n == 0) {
        putchar('0');
    }
    if (n < 0) {
        putchar('-');
        n = -n;
    }
    while (n > 0) {
        c[l++] = n % 10 + '0';
        n /= 10;
    }
    for (int i = l - 1; i >= 0; i--) {
        putchar(c[i]);
    }
    putchar('\n');
}

int main() {
    freopen("secventa.in", "r", stdin);
    freopen("secventa.out", "w", stdout);

    int n = cit(), k = cit();
    int* a = (int*)malloc((n + 1) * sizeof(int));
    for (int i = 1; i <= n; i++) {
        a[i] = cit();
    }
    int* d = (int*)malloc((n + 1) * sizeof(int));
    int st = 1, dr = 0, ans = -30001, poz;
    for (int i = 1; i <= n; i++) {
        while (st <= dr && a[i] < a[d[dr]]) {
            dr--;
        }
        d[++dr] = i;
        if (d[st] == i - k) {
            st++;
        }
        if (i >= k && a[d[st]] > ans) {
            poz = i - k + 1;
            ans = a[d[st]];
        }
    }

    printf("%d %d %d", poz, poz + k - 1, ans);

    return 0;
}