Buggy python submission (verdict: Runtime Error):
import collections
n,k,q=map(int,input().split())
a=[int(input()) for i in range(q)]
points=['No' for i in range(n)]
c = collections.Counter(a)

zone=k-q

if zone<1:
    for v in c.values():
        if abs(zone)+1<=v:
            points[v-1]='Yes'
for h in points:
  print(h)

Fixed submission:
import collections
n,k,q=map(int,input().split())
a=[int(input()) for i in range(q)]
points=['No' for i in range(n)]
c = collections.Counter(a)

zone=k-q


for v in c:
    
    if zone+c.get(v)>=1:
        points[v-1]='Yes'
if zone>=1:
    for h in points:
        print('Yes')
else:
    for h in points:
        print(h)

Buggy python submission (verdict: Time Limit Exceeded):
n,k,q=map(int,input().split())

a=[int(input()) for i in range(q)]
points=[k for i in range(n)]
for j in a:
    points[j-1]=points[j-1]+1
    for k in range(n):
        points[k]-=1
        
for ans in points:
    if ans>0:
        print('Yes')
    else:
        print('No')

Fixed submission:
import collections
n,k,q=map(int,input().split())
a=[int(input()) for i in range(q)]
points=['No' for i in range(n)]
c = collections.Counter(a)

zone=k-q


for v in c:
    
    if zone+c.get(v)>=1:
        points[v-1]='Yes'
if zone>=1:
    for h in points:
        print('Yes')
else:
    for h in points:
        print(h)

Buggy python submission (verdict: Runtime Error):
import collections
n,k,q=map(int,input().split())
a=[int(input()) for i in range(q)]
points=['No' for i in range(n)]
c = collections.Counter(a)

zone=k-q

if zone<1:
    for v in c.values():
        if abs(zone)+1=<v:
            points[v-1]='Yes'
        
    
    
    
        
    

print(points)

Fixed submission:
import collections
n,k,q=map(int,input().split())
a=[int(input()) for i in range(q)]
points=['No' for i in range(n)]
c = collections.Counter(a)

zone=k-q


for v in c:
    
    if zone+c.get(v)>=1:
        points[v-1]='Yes'
if zone>=1:
    for h in points:
        print('Yes')
else:
    for h in points:
        print(h)

Buggy python submission (verdict: Time Limit Exceeded):
n,k,q=map(int,input().split())

a=[int(input()) for i in range(q)]
points=[k for i in range(n)]
for j in a:
    points[j-1]=points[j-1]+1
    for k in range(n):
        points[k]-=1
        
for ans in points:
    if ans>0:
        print('Yes')
    else:
        print('No')

Fixed submission:
import collections
n,k,q=map(int,input().split())
a=[int(input()) for i in range(q)]
points=['No' for i in range(n)]
c = collections.Counter(a)

zone=k-q


for v in c:
    
    if zone+c.get(v)>=1:
        points[v-1]='Yes'
if zone>=1:
    for h in points:
        print('Yes')
else:
    for h in points:
        print(h)

Buggy python submission (verdict: Time Limit Exceeded):
n,k,q=map(int,input().split())

a=[int(input()) for i in range(q)]
points=[k for i in range(n)]
for j in a:
    points[j-1]=points[j-1]+1
    for k in range(n):
        points[k]-=1
        
for ans in points:
    if ans>0:
        print('Yes')
    else:
        print('No')
    

Fixed submission:
import collections
n,k,q=map(int,input().split())
a=[int(input()) for i in range(q)]
points=['No' for i in range(n)]
c = collections.Counter(a)

zone=k-q


for v in c:
    
    if zone+c.get(v)>=1:
        points[v-1]='Yes'
if zone>=1:
    for h in points:
        print('Yes')
else:
    for h in points:
        print(h)