#include <iostream>
#include <algorithm>

using namespace std;

int main()
{
    int n,i,k,ok,max=-1,aux,min=500001,p=0,w[101],v[101];
    cin>>n>>k;
    for(i=1;i<=n;i++)
        {
            cin>>v[i];
            w[++p]=i;
        }

    ok=0;
    while(ok==0)
    {
        ok=1;
        for(i=1;i<n;i++)
            if(v[i]>v[i+1])
            {
                aux=v[i];
                v[i]=v[i+1];
                v[i+1]=aux;
                aux=w[i];
                w[i]=w[i+1];
                w[i+1]=aux;
                ok=0;
            }
    }
    for(i=n-k+1;i<=n;i++)
    {
        if(w[i]<min)
            min=w[i];
        if(w[i]>max)
            max=w[i];
    }
    cout<<min<<" "<<max<<" "<<v[n-k+1];
    return 0;
}