#include <bits/stdc++.h>

using namespace std;

const int inf=0x3f3f3f3f;
const int nmax=500002;

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;
    }
};

deque <int> D;

int n,k,v[nmax],maxi=-inf,st;

int main()
{
    InParser fin ("secventa.in");
    ofstream fout ("secventa.out");
    int a;
    fin>>n>>k;
    for(int i=1;i<=n;++i){
        fin>>a;
        v[i]=a;
        while(!D.empty() && v[D.back()]>=a)D.pop_back();
        D.push_back(i);
        if(D.front()<=i-k)D.pop_front();
        int y=v[D.front()];
        if(i>=k && v[D.front()]>maxi){
            maxi=v[D.front()];
            st=i;
        }
    }
    fout<<st-k+1<<' '<<st<<' '<<maxi<<'\n';
    return 0;
}