#include <iostream>
#include <vector>
#include <unordered_map>
#include <algorithm> // Include this header for std::find

using namespace std;

int main() {
    int n, k, c;
    cin >> n >> k >> c;

    vector<pair<int, int>> teams(n); // Pair of team ID and school ID
    for (int i = 0; i < n; i++) {
        cin >> teams[i].first >> teams[i].second;
    }

    vector<int> selected_teams;          // IDs of selected teams
    unordered_map<int, int> school_count;  // Count of teams selected per school

    int selected_count = 0;
    vector<bool> selected(n, false); // Keep track of whether team at index i is selected

    // First Pass: Select teams within the school limit
    for (int i = 0; i < n && selected_count < k; i++) {
        int school_id = teams[i].second;

        if (school_count[school_id] < c) {
            selected_teams.push_back(teams[i].first); // Store team ID
            school_count[school_id]++;
            selected_count++;
            selected[i] = true;
        }
    }

    // Second Pass: Fill remaining slots with teams over the school limit
    if (selected_count < k) {
        for (int i = 0; i < n && selected_count < k; i++) {
            if (!selected[i]) {
                // Select this team regardless of the school limit
                selected_teams.push_back(teams[i].first); // Store team ID
                // No need to increment school_count here
                selected_count++;
                // selected[i] = true; // Optional, since we're done after this
            }
        }
    }

    // Output the selected teams in rank order
    for (int id : selected_teams) {
        cout << id << endl;
    }

    return 0;
}