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

#define nl "\n"
#define ll long long
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define sz(v) (int) v.size()

template<typename T = int>
istream &operator>>(istream &in, vector<T> &v) {
    for (auto &x: v) in >> x;
    return in;
}

template<typename T = int>
ostream &operator<<(ostream &out, const vector<T> &v) {
    for (const T &x: v) out << x << nl;
    return out;
}

void Sira() {
    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 n , k , c;
    cin >> n >> k >> c;

    vector < pair < int , int > > v(n);

    set < int > st;

    for(int i = 0 ; i < n ; i++){
        cin >> v[i].first >> v[i].second;
        st.insert(v[i].second);
    }
    
    vector < int > ans(n + 5);

    map < int , int > mp , vis;

    int cnt = 0 , idx = 0;
    for(int i = 0 ; i < n ; i++){
        if(cnt < k and mp[v[i].second] < c){
            ans[i] = v[i].first;
            mp[v[i].second]++;
            vis[v[i].first] = 1;
        }
    }

    if(cnt < k){
        for(int i = 0 ; i < n and cnt < k ; i++){
            if(!vis[v[i].first]){
                cnt++;
                ans[i] = v[i].first;
                vis[v[i].first] = 1;
            }
        }
    }

    for(int i = 0 ; i < n ; i++){
        if(ans[i]) cout << ans[i] << nl;
    }

}

int main() {
    Sira();
    int t = 1;
//    cin >> t;
    while(t--){
        solve();
    }
    return 0;
}