n,d,k=map(int,input().split())

cnt=[0]*100005
an=[0]*100005

f=[[0 for _ in range(2)]for _ in range(100005)]

for i in range(n):
    st,ix=map(int,input().split())
    f[i][0],f[i][1]=st,ix
f=sorted(f[:n])

i=0
j=0

while i<n:
    t=f[i][1]
    cnt[t]+=1

    while(f[i][0]-f[j][0]>=d):
        cnt[f[j][1]]-=1
        j+=1

    if cnt[t]>=k:
        an[t]=1

    i+=1


for i in range(100005):
    if an[i]==1:
        print(i)