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

struct Competitor {
    int score;
    int index;
};

bool compare(const Competitor &a, const Competitor &b) {
    if (a.score == b.score) return a.index < b.index;
    return a.score > b.score;
}

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

    vector<Competitor> competitors(N);
    for (int i = 0; i < N; ++i) {
        cin >> competitors[i].score;
        competitors[i].index = i + 1;
    }

    // Calculate medal thresholds
    int gold_limit = N / 12;
    int silver_limit = N / 4;
    int bronze_limit = N / 2;

    // Variables to store the last presentation number for each medal
    int last_gold = 0, last_silver = 0, last_bronze = 0;

    vector<Competitor> current_ranking;

    for (int i = 0; i < N; ++i) {
        current_ranking.push_back(competitors[i]);
        sort(current_ranking.begin(), current_ranking.end(), compare);

        // Find Bendegúz's position
        int bendeguz_position = 0;
        for (int j = 0; j < current_ranking.size(); ++j) {
            if (current_ranking[j].index == K) {
                bendeguz_position = j + 1;
                break;
            }
        }

        // Update the last medal positions
        if (bendeguz_position > 0 && bendeguz_position <= gold_limit) {
            last_gold = i + 1;
        } else if (bendeguz_position > gold_limit && bendeguz_position <= silver_limit) {
            last_silver = i + 1;
        } else if (bendeguz_position > silver_limit && bendeguz_position <= bronze_limit) {
            last_bronze = i + 1;
        }
    }

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

    return 0;
}