#include <fstream>
#include <deque>
#include <climits>

#pragma GCC optimize("O1")
#pragma GCC optimize("O2")
#pragma GCC optimize("O3")

using namespace std;
const int NMAX=500000;

deque <int> Q;
int v[NMAX+5];

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 fin("secventa.in");
ofstream fout("secventa.out");

int main()
{
    ios_base::sync_with_stdio(false);

    int n,k,i,minx,start,endx;
    fin>>n>>k;
    for(i=1;i<=n;i++)
        fin>>v[i];
    minx=INT_MIN;
    for(i=1;i<=n;i++)
    {
        while(!Q.empty() and v[Q.back()]>v[i])
            Q.pop_back();
        Q.push_back(i);
        if(!Q.empty() and Q.front()<=i-k)
            Q.pop_front();
        if(i>=k and v[Q.front()]>minx){
            minx=v[Q.front()];
            start=i-k+1;
            endx=i;
        }
    }
    fout<<start<<" "<<endx<<" "<<minx;
    fout.close();
    return 0;
}