#include <bits/stdc++.h>

using namespace std;

const int NMAX = 500001;

int n,k;
int hmax=-30003,a,b;
int v[NMAX];

deque<int>q;

class InParser {
private:
    FILE *fin;
    char *buff;
    int sp;

    char read_ch() {
        ++sp;
        if (sp == 4096) {
            sp = 0;
            fread(buff, 1, 4096, fin);
        }
        return buff[sp];
    }

public:
    InParser(const char* nume) {
        fin = fopen(nume, "r");
        buff = new char[4096]();
        sp = 4095;
    }

    InParser& operator >> (int &n) {
        char c;
        while (!isdigit(c = read_ch()) && c != '-');
        int sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }

    InParser& operator >> (long long &n) {
        char c;
        n = 0;
        while (!isdigit(c = read_ch()) && c != '-');
        long long sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }
};

int main(){
    InParser in("secventa.in");
    freopen("secventa.out","w",stdout);
    in>>n>>k;
    for(int i=1;i<=n;i++){
        in>>v[i];
        while(!q.empty() && v[i] < v[q.back()]){
            q.pop_back();
        }
        q.push_back(i);
        if(i-q.front()>=k){
            q.pop_front();
        }
        if(i>=k){
            if(hmax < v[q.front()]){
                hmax = v[q.front()];
                a = i - k+1;
                b = i;
            }

        }
    }
    printf("%d %d %d",a,b,hmax);
    return 0;
}