#include <bits/stdc++.h>
using namespace std;

int v[5000005];

deque<int> dq;
int n, k;

int main() {
    freopen("secventa.in", "r", stdin);
    freopen("secventa.out", "w", stdout);
    int n, k, mm = 0;
    scanf("%d %d", &n, &k);
    for (int i = 1; i <= n; ++i)
        scanf("%d", &v[i]);

    for (int i = 1; i <= k; i++) {
        while(!dq.empty() && v[dq.back()] >= v[i]) {
            dq.pop_back(); }
        dq.push_back(i); }
    mm = v[dq.front()];

    for (int i = k + 1; i <= n; i++) {
        if (i - dq.front() >= k)
            dq.pop_front();
        while(!dq.empty() && v[dq.back()] >= v[i]) {
            dq.pop_back(); }
        dq.push_back(i);
        mm = max(mm, v[dq.front()]); }

    for(int i = 1; i <= n; i++) {
        if (v[i] == mm) {
            int l = 1, q = i - 1;
            while(v[q] >= mm && q >= 1) {
                q--;
                l++; }
            int p = i + 1;
            if (l >= k) {
                printf("%d %d %d", q + 1, i, mm);
                return 0; }

            while(v[p] >= mm && p <= n) {
                p++;
                l++;
                if (l >= k) {
                    printf("%d %d %d", q + 1, p - 1, mm);
                    return 0; } } } }

    return 0; }