#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
const int N=100010;
using namespace std;
#define x first
#define y second
typedef pair<int,int> PII;
PII a[N];
int cnt[N];
int ts[N];
int main(){
    int n,d,k;
    cin>>n>>d>>k;
    for(int i=0;i<n;i++){
        cin>>a[i].x>>a[i].y;
    }
    sort(a,a+n);

    for(int i=0,j=0;i<n;i++){
        int id=a[i].y;
        cnt[id]++;
        while(a[i].x-a[j].x>=d){
            cnt[a[j].y]--;
            j++;
        }
        if(cnt[id]>=k)ts[id]=1;
    }

    for(int i=0;i<N;i++){
        if(ts[i])cout<<i<<endl;
    }
}