#include <bits/stdc++.h>
// pbds
/*#include <ext/pb_ds/assoc_container.hpp> // Common file*/
/*#include <ext/pb_ds/tree_policy.hpp>*/
/**/
/*using namespace __gnu_pbds;*/
using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x...) 42
#endif
#define fast_io                                                                \
  ios_base::sync_with_stdio(false);                                            \
  cin.tie(NULL);                                                               \
  cout.tie(NULL);
#define ll long long
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

/*typedef tree<int, null_type, less<int>, rb_tree_tag,*/
/*             tree_order_statistics_node_update>*/
/*    ordered_set;*/
const int N = 1e5 + 5;
bool vis[N];
void solve() {
  ll n, k, c;
  cin >> n >> k >> c;
  vector<pair<int, int>> vp(n);
  memset(vis, 0, sizeof vis);
  map<ll, ll> mp;
  for (int i = 0; i < n; i++) {
    cin >> vp[i].first;
    cin >> vp[i].second;
    mp[vp[i].second] = c;
  }
  ll curr = 0;
	vector<pair<ll,ll>> ans;
  for (int i = 0; i < n && curr < k; i++) {
    if (mp[vp[i].second] != 0) {
			ans.push_back({i,vp[i].first});
      mp[vp[i].second]--;
      vis[vp[i].first] = 1;
      curr++;
    }
  }
  int i = 0;
  while (curr < k and i < n) {
    if (!vis[vp[i].first]) {
			ans.push_back({i,vp[i].first});
      vis[vp[i].first] = 1;
      curr++;
    }
		i++;
  }
	sort(all(ans));
	for(auto x:ans){
		cout<<x.second<<"\n";
	}
	cout<<"\n";
}

int main() {
  fast_io;
#ifdef LOCAL
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
  freopen("output.txt", "w", stderr);
#endif
  ll t = 1;
  /*cin >> t;*/
  while (t--) {
#ifdef LOCAL
    cout << "TEST CASE " << t + 1 << "\n";
#endif
    solve();
  }
#ifdef LOCAL
  cout << endl
       << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec\n\n";
#endif
  return 0;
}