#include <bits/stdc++.h>
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 fin("secventa.in");
ofstream fout("secventa.out");
int n,k,a[500005];
deque <int> q;
int maxi,l;
int main()
{
    int i;
fin>>n>>k;
for(i=1;i<=n;i++)
    fin>>a[i];
for(i=1;i<=k;i++)
{
    while(!q.empty()&&a[i]<a[q.back()])
        q.pop_back();
    q.push_back(i);
}
maxi=a[q.front()];
l=k;
for(i=k+1;i<=n;i++)
{
    while(!q.empty()&&a[i]<a[q.back()])
        q.pop_back();
    q.push_back(i);
    while(!q.empty()&&q.front()<i-k+1)
        q.pop_front();
    if(a[q.front()]>maxi)
    {
        maxi=a[q.front()];
        l=i;
    }
}
fout<<l-k+1<<" "<<l<<" "<<maxi;
    return 0;
}