Buggy python submission (verdict: Time Limit Exceeded):
n,k,q=(int(x) for x in input().split())
a=[]
p=[]
for i in range(0,q):
    temp=int(input())
    a.append(temp)
border=-k+q

res = '\n'.join('Yes' if a.count(j+1)> border else 'No' for j in range(0,n))

print(res)


Fixed submission:
n,k,q=(int(x) for x in input().split())
a=[]
p=[0]*n
for i in range(0,q):
    temp=int(input())
    p[temp-1]+=1
border=-k+q

res = '\n'.join('Yes' if p[j]> border else 'No' for j in range(0,n))

print(res)

Buggy python submission (verdict: Time Limit Exceeded):
n,k,q=(int(x) for x in input().split())
a=[]
p=[]
for i in range(0,q):
    temp=int(input())
    a.append(temp)
border=-k+q
for j in range(0,n):
    if a.count(j+1)>border:
        print('Yes')
    else:
        print('No')

#print(p)


Fixed submission:
n,k,q=(int(x) for x in input().split())
a=[]
p=[0]*n
for i in range(0,q):
    temp=int(input())
    p[temp-1]+=1
border=-k+q

res = '\n'.join('Yes' if p[j]> border else 'No' for j in range(0,n))

print(res)

Buggy python submission (verdict: Time Limit Exceeded):
n,k,q=(int(x) for x in input().split())
a=[]
p=[]
for i in range(0,q):
    temp=int(input())
    a.append(temp)
for j in range(0,n):
    p.append(a.count(j+1))
border=-k+q
for m in range(0,n):
    if p[m] >border:
        print('Yes')
    else:
        print('No')
#print(p)


Fixed submission:
n,k,q=(int(x) for x in input().split())
a=[]
p=[0]*n
for i in range(0,q):
    temp=int(input())
    p[temp-1]+=1
border=-k+q

res = '\n'.join('Yes' if p[j]> border else 'No' for j in range(0,n))

print(res)

Buggy python submission (verdict: Time Limit Exceeded):
n,k,q=(int(x) for x in input().split())
a=[]
p=[]
for i in range(0,q):
    temp=int(input())
    a.append(temp)
for j in range(0,n):
    p.append(a.count(j+1))
for m in range(0,n):
    c=k+(-1)*q+p[m]
    #print('No %d point is %d'% (m,c))
    if c >0:
        print('Yes')
    else:
        print('No')
#print(p)


Fixed submission:
n,k,q=(int(x) for x in input().split())
a=[]
p=[0]*n
for i in range(0,q):
    temp=int(input())
    p[temp-1]+=1
border=-k+q

res = '\n'.join('Yes' if p[j]> border else 'No' for j in range(0,n))

print(res)

Buggy python submission (verdict: Time Limit Exceeded):
n,k,q=(int(x) for x in input().split())
a=[]
p=[]
for i in range(0,q):
    temp=int(input())
    a.append(temp)
for j in range(0,n):
    p.append(a.count(j+1))
for m in range(0,n):
    c=k+(-1)*(sum(p))+p[m]
    #print('No %d point is %d'% (m,c))
    if c >0:
        print('Yes')
    else:
        print('No')
#print(p)


Fixed submission:
n,k,q=(int(x) for x in input().split())
a=[]
p=[0]*n
for i in range(0,q):
    temp=int(input())
    p[temp-1]+=1
border=-k+q

res = '\n'.join('Yes' if p[j]> border else 'No' for j in range(0,n))

print(res)

Buggy python submission (verdict: Time Limit Exceeded):
n,k,q=(int(x) for x in input().split())
a=[]
p=[]
for i in range(0,q):
    temp=int(input())
    a.append(temp)
for j in range(0,n):
    p.append(a.count(j+1))
for m in range(0,n):
    c=k
    for l in range(0,n):
        if l!=m:
            c +=-1*p[l]
    #print('No %d point is %d'% (m,c))
    if c >0:
        print('Yes')
    else:
        print('No')
#print(p)


Fixed submission:
n,k,q=(int(x) for x in input().split())
a=[]
p=[0]*n
for i in range(0,q):
    temp=int(input())
    p[temp-1]+=1
border=-k+q

res = '\n'.join('Yes' if p[j]> border else 'No' for j in range(0,n))

print(res)