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

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