#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;

#define pb push_back

const ld pi = 3.14159265358979323846;
const int mod = (int)1e9 + 7;
const ll INF = 1e18;

template<typename T>
T chmax(T a, T b) {
    return a > b ? a : b;
}

template<typename T>
T chmin(T a, T b) {
    return a > b ? b : a;
}

const int N = (int)2e5 + 1, M = N * 2;

void solve(){
    int n, k, c;
    cin >> n >> k >> c;

    map<int, int> mp, rec;
    vector<vector<int>> a, b;

    for(int i = 0; i < n; i++){
        int s, t;
        cin >> s >> t;
        a.pb({s, t});
        if(mp[t] >= c || k <= 0) continue;
        b.pb({i, s});
        rec[i] = 1;
        mp[t]++;
        k--;
    }

    for(int i = 0; i < a.size(); i++){
        if(rec[i] != 1 && k){
            b.pb({i, a[i][0]});
        }
    }

    sort(b.begin(), b.end());
    for(auto e : b) cout << e[1] << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(0);

    int t = 1;
    // cin >> t; 

    while(t--){
        solve();
    }

    return 0;
}