#include <iostream>
#include <fstream>
#include <set>
using namespace std;
int n, k, a, b, c=0, minim;
multiset<int> heap;
int main(){
    ifstream f("secventa.in");
    f>>n>>k;
    f>>minim;
    heap.insert(minim);
    while(f>>n){
        if(heap.size()==k)
        {
            c++;
            if(minim>*heap.begin());
                minim=*heap.begin(), a=c, b=c+k;
            heap.erase(heap.begin());
        }
        heap.insert(n);
    }
    if(minim>*heap.begin());
        minim=*heap.begin(), a=c, b=c+k;

    ofstream g("secventa.out");
    //cout<<a+1<<" "<<b<<" "<<minim;
    g<<a+1<<" "<<b<<" "<<minim;
    return 0;
}