#include <iostream>
#include <fstream>
#include <cstdio>
#include <deque>
#include <cctype>
using namespace std;
ofstream g("secventa.out");
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;
    }
};
 
InParser f("secventa.in");
deque<int>dq;
int n,k,x[500100],m[500100],sol,p;
int main(int argc, const char * argv[]) {
    f>>n>>k;
    for(int i=1;i<=n;i++)
    {
        f>>x[i];
        while(!dq.empty() && x[i]<x[dq.back()])
            dq.pop_back();
        dq.push_back(i);
        if(dq.front()+k<=i)
            dq.pop_front();
        m[i]=x[dq.front()];
    }
    for(int i=1;i<=n;i++)
        if(m[i]>sol)
        {
            sol=m[i];
            p=i;
        }
    g<<p-k+1<<' '<<p<<' '<<sol;
    return 0;
}