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

int main() {
    int n, k, c;
    cin >> n >> k >> c;
    
    vector<pair<int, int>> teams(n); // to store team ID and school ID
    for (int i = 0; i < n; i++) {
        cin >> teams[i].first >> teams[i].second;
    }
    
    vector<int> qualified_teams;
    unordered_map<int, int> school_count; // to count how many teams per school
    
    for (int i = 0; i < n && qualified_teams.size() < k; i++) {
        int team_id = teams[i].first;
        int school_id = teams[i].second;
        
        // Check if the school has not exceeded the limit, or if we need more teams
        if (school_count[school_id] < c || qualified_teams.size() + (c - school_count[school_id]) < k) {
            qualified_teams.push_back(team_id);
            school_count[school_id]++;
        }
    }
    
    // Output the qualified teams in rank order
    for (int i = 0; i < k; i++) {
        cout << qualified_teams[i] << endl;
    }

    return 0;
}