#include <iostream>
#include <vector>
#include <set>
using namespace std;

int main() {
    int N, K;
    cin >> N >> K;

    vector<int> scores(N);
    for (int i = 0; i < N; ++i) {
        cin >> scores[i];
    }

    int gold_limit = N / 12;
    int silver_limit = N / 4;
    int bronze_limit = N / 2;

    int last_gold = 0, last_silver = 0, last_bronze = 0;


    multiset<int, greater<int>> current_scores;

    for (int i = 0; i < N; ++i) {
        current_scores.insert(scores[i]);

        auto bendeguz_iter = current_scores.find(scores[K - 1]);
        int bendeguz_position = distance(current_scores.begin(), bendeguz_iter) + 1;

        if (bendeguz_position <= gold_limit) {
            last_gold = i + 1;
        } else if (bendeguz_position <= silver_limit) {
            last_silver = i + 1;
        } else if (bendeguz_position <= bronze_limit) {
            last_bronze = i + 1;
        }
    }

    cout << last_gold << endl;
    cout << last_silver << endl;
    cout << last_bronze << endl;

    return 0;
}