#include <bits/stdc++.h>

using namespace std;

int n,k,p,u,val,a[500012];

int minim(int pr,int k){
    int val=a[pr];
  for (int i=pr;i<=k;i++ )
    if (a[i]<val) val=a[i];

  return val;
}

int main()
{
    ifstream fi("secventa.in");
    ofstream fo("secventa.out");

    fi>>n>>k;
    p=1;u=k;
    for (int i=1;i<=k;i++)
        fi>>a[i];

    val=minim(1,k);
    for (int i=k+1;i<=n;i++){
        fi>>a[i];
            if (a[i]>val){

                    val=minim(i-k+1,i);
                    p=i-k+1; u=i;

            }

    }
    fo<<p<<u<<val;


    return 0;
}