/* [A][M][C][B][N] / [K][R][I][P][6][8] */
#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353, inf = 0x3f3f3f3f;
const char sp = ' ', nl = '\n';
ifstream fin("secventa.in");
ofstream fout("secventa.out");
#define nmax 500005
int v[nmax], mn[nmax];
deque<int> dq;
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int n, k;
    fin >> n >> k;
    int ans = k;
    for (int i = 1; i <= n; ++i) {
        fin >> v[i];
        while (!dq.empty() && dq.front() <= i - k)
            dq.pop_front();
        while (!dq.empty() && v[dq.back()] > v[i])
            dq.pop_back();
        dq.push_back(i);
        mn[i] = dq.front();
        if (i > k)
            if (v[mn[ans]] < v[mn[i]])
                ans = i;
    }
    fout << ans - k + 1 << sp << ans << sp << v[mn[ans]];
}