#include <bits/stdc++.h>
#include <random>
#include <chrono>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const char nl = '\n';
const char sp = ' ';
const int inf = 0x3f3f3f3f;
const long long INF = 1000000000000000000;
const int mod = 31607;
const char out[2][4]{ "No", "Yes" };
#define all(a) a.begin(), a.end()
using ll = long long;
ifstream fin("secventa.in");
ofstream fout("secventa.out");

#define variableName(var) #var
#define __debug(var) cout << #var << " = " << var << '\n'
inline int rint(int a, int b) { return uniform_int_distribution<int>(a, b)(rng); }
const void ckadd(int& a, int b) { a = (a + b) % mod; }

const int nmax = 5e5;

struct Deque {
    int t[nmax + 5]{ 0 };
    int l = 1, r = 1; // [l, r)
    bool empty() { return l == r; }
    int size() { return r - l; }
    void push_back(int x) { t[r++] = x; }
    void pop_back() { assert(!empty()); r--; }
    void pop_front() { assert(!empty()); l++; }
    int front() { assert(!empty()); return t[l]; }
    int back() { assert(!empty()); return t[r - 1]; }
} dq;

int n, k;
int v[nmax + 5]{ 0 };
int w[nmax + 5]{ 0 };


int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    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);
        w[i] = dq.front();
        if (i > k && v[w[ans]] < v[w[i]]) {
            ans = i;
        }
    }
    fout << ans - k + 1 << sp << ans << sp << v[w[ans]];
}