#include <iostream>
#include <bits/stdc++.h>
using ll = long long;
using namespace std;

int main()
{
    ll n, k; cin >> n >> k;
    vector<ll> v(n+1, 0);
    for (ll i = 1; i <= n; i++){
        cin >> v[i];
    }
    ll ranking = 1;
    ll g = 0, s = 0, b = 0;
    for (ll i = 1; i < k; i++){
//        if (ranking <= n/12) g = i;
//        else if (ranking <= n/4) s = i;
//        else if (ranking <= n/2) b = i;
        if (v[i] > v[k]) ranking++;
    }
    if (ranking <= n/12) g = k+1;
    else if (ranking <= n/4) s = k+1;
    else if (ranking <= n/2) b = k+1;
    for (ll i = k+1; i <= n; i++){
        if (v[i] > v[k]) ranking++;
        if (ranking <= n/12) g = i;
        else if (ranking <= n/4) s = i;
        else if (ranking <= n/2) b = i;
    }
//    if (ranking <= n/12) g = n;
//    else if (ranking <= n/4) s = n;
//    else if (ranking <= n/2) b = n;
    cout << g << "\n" << s << "\n" << b;
    return 0;
}