#include <bits/stdc++.h>

using namespace std;

ifstream fin("deque.in");
ofstream fout("deque.out");
long long n, k, i, m = -999999, u;
int a[500002];
int q[500002], st = 1, dr;

int main() {
    fin >> n >> k;
    for(i = 1; i <= n; i++) fin >> a[i];
    for(i = 1; i < k; i++) {
        while(dr >= st && a[i] <= a[q[dr]]) dr--;
        q[++dr] = i;
    }
    for(i = k; i <= n; i++) {
        if(i - k + 1 > q[st]) st++;
        while(dr >= st && a[i] <= a[q[dr]]) dr--;
        q[++dr] = i;
        if(m < a[q[st]]) {
            u = i;
            m = a[q[st]];
        }
    }
    fout << u - k + 1 << " " << u << " " << m;

    return 0;
}