#include <cstdio>
#include <iostream>
#include <vector>
#include <set>
#include <cmath>
#include <climits>
#include <list>
#include <iomanip>
#include <cstdlib>
#include <fstream>
#include <map>
#include <algorithm>
#include <string>
#include <deque>

using namespace std;

long long cit() {
    long long 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;
}

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

   // ios_base::sync_with_stdio(false);
   // cin.tie(0);

    int n = cit(), k = cit();
    int* v = (int*)malloc((n + 1) * sizeof(int));
    int* d = (int*)malloc((n + 1) * sizeof(int));
    for (int i = 1; i <= n; i++)
        v[i] = cit();
    int ans = -30005, e, fr = 1, ba = 0;
    for (int i = 1; i < k; i++) {
        while (fr <= ba && v[i] <= v[d[ba]])
            ba--;
        d[++ba] = i;
    }
    for (int i = k; i <= n; i++) {
        while (fr <= ba && v[i] <= v[d[ba]])
            ba--;
        d[++ba] = i;
        if (d[fr] == i - k)
            fr++;
        if (v[d[fr]] > ans) {
            ans = v[d[fr]];
            e = i;
        }
    }
    cout << e - k + 1 << " " << e << " " << ans;

    return 0;
}