#include <bits/stdc++.h>
  
using namespace std;

#define pb push_back
#define sz(x) int(x.size())
#define all(vec) vec.begin(), vec.end()
#define rall(vec) vec.rbegin(), vec.rend()
#define cin(v) for (auto& cn : v)  cin >> cn;
#define cout(v) for (auto &cn : v) cout << cn << " ";
#define MOD int(1e9+7)
// #define endl "\n"
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

void Haidy()
{
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#ifndef ONLINE_JUDGE
    //freopen("input.txt","r",stdin),freopen("output.txt","w",stdout);
#endif
}
 
void solve();
int main()
{
    Haidy();
    int t = 1;
    // cin >> t;
    for(int i = 1;i<=t; i++)
    {
        solve();
    }
    return 0;
}
// int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
// int dy[] = {1, -1, 0, 0, 1, -1, -1, 1};

struct team{
    int id, school;
};

void solve()
{
    int n, q, lim;
    cin >> n >> q >> lim;
    vector<team> teams(n);
    map<int, int> cnt;
    for(int i = 0; i < n; i++){
        cin >> teams[i].id >> teams[i].school;
        cnt[teams[i].school]++;
    }
    int rem = 0, sum = 0;
    for(auto[school, num] : cnt){
        if(sum ==  q)
            break;
        int diff = q - sum;
        int to_add = min({diff, num, lim});
        sum += to_add;
    }
    cnt.clear();
    for(team& t : teams){
        if(cnt[t.school] < lim){
            cnt[t.school]++;
        }
        else if(rem > 0){
            rem--;
        }
        else{
            continue;
        }
        q--;
        cout << t.id << endl;
        if(q == 0)
            break;
    }
}