#include <fstream>
#include <queue>
using namespace std;

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

int n,k,A[500005];
deque <int> D;
int main()
{
    fi>>n>>k;
    int maxim=-50000,sf=0;
    for (int i=1; i<=n; i++)
        fi>>A[i];

    for (int i=1; i<=n; i++)
    {
        while (!D.empty() && A[D.back()]>=A[i])
            D.pop_back();
        D.push_back(i);

        if (D.front()==i-k)
            D.pop_front();

        if (i>=k)
        {
            if (A[D.front()]>maxim)
                maxim=A[D.front()],sf=i;
        }
    }
    fo<<sf-k+1<<" "<<sf<<" "<<maxim;
    return 0;
}