#include <iostream>
#include <algorithm>
#include <vector>

struct Team
{
    int rank;
    int id;
    int school;
    
    bool operator<(const Team &other) const
    {
        return rank < other.rank;
    }
};
    
int main()
{
    int n, k;
    std::cin >> n >> k;
    int c;
    std::cin >> c;
    std::vector<Team> teams(n);
        
    for(int i=0; i<n; i++)
    {
        teams[i].rank = i;
        int t, s;
        std::cin >> t >> s;
        teams[i].id = t;
        teams[i].school = s-1;
    }
    std::vector<int> schoolcount(n);
    std::vector<Team> leftovers;
    std::vector<Team> advanced;
    for(int i=0; i<n && advanced.size() < k; i++)
    {
        if(schoolcount[teams[i].school] < c)
        {
            advanced.push_back(teams[i]);
            schoolcount[teams[i].school]++;
        }
        else
        {
            leftovers.push_back(teams[i]);
        }
    }
    for(int i=0; advanced.size() < k; i++)
        advanced.push_back(leftovers[i]);
    std::sort(advanced.begin(), advanced.end());
    for(auto it : advanced)
        std::cout << it.id << std::endl;
}