#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int n,k,v[500005];
int MIN(int st, int dr) {
    int k=100000;
    for(int i=st;i<=dr;i++)
        k=min(k,v[i]);
    return k;}
int main() {
    ifstream cin("secventa.in");
    ofstream cout("secventa.out");
    cin>>n>>k;
    for(int i=1;i<=n;i++)
        cin>>v[i];
    int st,dr,m=-100000,l=0,maxst,maxdr;
    for(st=dr=1;dr<=n;dr++) {
        l++;
        while(l==k) {
            int x=MIN(st,dr);
            l--;
            if(x>m) {
                maxst=st;
                maxdr=dr;
                m=x;}
            st++;}}
    cout<<maxst<<" "<<maxdr<<" "<<m;
    return 0;}