qyliang/CodeNanoFix huggingface dataset:
Buggy code:
n,k,q = map(int, input().split())


a = [k] * n

for i in range(q):
  A = int(input())
  a[A-1] -= 1

for i in a:
  if i > 0:
    print('Yes')
  else:
    print('No')


Fixed code:
n,k,q = map(int,input().split())
l = [k-q]*n

for i in range(q):
    a = int(input())
    a -= 1
    l[a] += 1

for i in range(n):
    if l[i] > 0:
        print('Yes')
    else:
        print('No')
Buggy code:
n, k, q = map(int,input().split())
points = [k-q]*n

for i in range(q):
  m = int(input())
  points[m-1] = points[m-1] + 1
  print(points)

for j in range(len(points)):
  if points[j] <= 0:
    print('No')
  else:
    print('Yes')

Fixed code:
n, k, q = map(int,input().split())
points = [k-q]*n

for i in range(q):
  m = int(input())
  points[m-1] = points[m-1] + 1

for j in range(len(points)):
  if points[j] <= 0:
    print('No')
  else:
    print('Yes')
Buggy code:
from collections import Counter
N, K, Q = map(int, input().split())
answers = [int(input()) for i in range(Q)]
counts = Counter(answers)
print(counts)
for i in range(1,N+1):
  if K-(Q-counts[i])>0:
    print("Yes")
  else:
    print("No")

Fixed code:
from collections import Counter
N, K, Q = map(int, input().split())
answers = [int(input()) for i in range(Q)]
counts = Counter(answers)
for i in range(1,N+1):
  if K-(Q-counts[i])>0:
    print("Yes")
  else:
    print("No")
Buggy code:
n,k,q = map(int, input().split())

scores = []

for i in range(n):
  scores.append(n-k)

for i in range(q):
  a = int(input()) #Ai
  scores.insert(a-1, scores[a-1]+1)
  
  
for i in range(n):
  if(scores[i] > 0):
    print("Yes")
  elif:
    print("No")

Fixed code:
n,k,q = map(int, input().split())
 
scores = []
 
for i in range(n):
  scores.append(k-q)
 
for i in range(q):
  a = int(input()) #Ai
  scores[a-1] = scores[a-1]+1
  
for i in range(n):
  if(scores[i] > 0):
    print("Yes")
  else:
    print("No")
Buggy code:
ss = input().split()
N = int(ss[0])
K = int(ss[1])
Q = int(ss[2])
As = []

SCORE = [0] * N

for i in range(Q):
  SCORE[int(input())-1] += 1
print(SCORE)
for i in range(N):
  if(SCORE[i]<= Q-K):
    print("No")
  else:
    print("Yes")

Fixed code:
ss = input().split()
N = int(ss[0])
K = int(ss[1])
Q = int(ss[2])
As = []

SCORE = [0] * N

for i in range(Q):
  SCORE[int(input())-1] += 1
for i in range(N):
  if(SCORE[i]<= Q-K):
    print("No")
  else:
    print("Yes")
Buggy code:
n, k, q = map(int, input().split())
answers = []
for _ in range(q):
    answers.append(int(input()))

cnt_list = [(k-q)]*n
if q < k:
    for _ in range(n):
        print('Yes')
else:
    for i in answers:
        cnt_list[i-1] += 1

for i in cnt_list:
    print('Yes') if i > 0 else print('No')

Fixed code:
n, k, q = map(int, input().split())
answers = []
for _ in range(q):
    answers.append(int(input()))

cnt_list = [(k-q)]*n
if q < k:
    for _ in range(n):
        print('Yes')
else:
    for i in answers:
        cnt_list[i-1] += 1
    for i in cnt_list:
        print('Yes') if i > 0 else print('No')
Buggy code:
def main():
    N, K, Q = list(map(int, input().split()))
    S =[K-Q]*N
    A=[]
    for i in range(Q):
        A.append(int(input())-1)
    for i in A:
        S[i] = S[i]+1
        print(S)
    for i in range(N):
        if S[i]<1:
            print('No')
        else:
            print('Yes')
if __name__ == '__main__':
    main()

Fixed code:
def main():
    N, K, Q = list(map(int, input().split()))
    S =[K-Q]*N
    A=[]
    for i in range(Q):
        A.append(int(input())-1)
    for i in A:
        S[i] = S[i]+1
    for i in range(N):
        if S[i]<1:
            print('No')
        else:
            print('Yes')
if __name__ == '__main__':
    main()
Buggy code:
N,K,Q=map(int,input().split(" "))
A=[int(input()) for _ in range(Q)]
T=[0 for _ in range(N)]

for i in range(Q):
    T[A[i]-1]=T[A[i]-1]+1
for i in range(N):
    T[i]=T[i]-(Q-K)
    if T[i]<=0:
        print("No")
    else:
        print("Yes")
print(T)

Fixed code:
N,K,Q=map(int,input().split(" "))
A=[int(input()) for _ in range(Q)]
T=[0 for _ in range(N)]

for i in range(Q):
    T[A[i]-1]=T[A[i]-1]+1
for i in range(N):
    T[i]=T[i]-(Q-K)
    if T[i]<=0:
        print("No")
    else:
        print("Yes")
Buggy code:
N, K, Q = map(int, input().split())
points = [K-Q]*(N)
for i in range(Q):
    A = int(input())
    A -= 1
    points[A] += 1
print(points)
for p in points:
    if p >0:
        print("Yes")
    else:
        print("No")

Fixed code:
N, K, Q = map(int, input().split())
points = [K-Q]*(N)
for i in range(Q):
    A = int(input())
    A -= 1
    points[A] += 1
# print(points)
for p in points:
    if p >0:
        print("Yes")
    else:
        print("No")
Buggy code:
people_num, first_point, correct = map(int,input().split())
who_correct = [input() for i in range(correct)]
points = [first_point-correct for i in range(people_num)]

for i in range(correct):
  for j in range(people_num):
    points[int(who_correct[i])-1] += 1

for i in range(people_num):
  if points[i] < 0:
  	print("No")
  else:
    print("Yes")

Fixed code:
people_num, first_point, correct = map(int,input().split())
who_correct = [input() for i in range(correct)]
points = [first_point-correct for i in range(people_num)]

 
for i in range(correct):
    points[int(who_correct[i])-1] += 1
    
for i in range(people_num):
  if points[i] <= 0:
  	print("No")
  else:
    print("Yes")
Buggy code:
N, K, Q = map(int, input().split())
A = []
for i in range(Q):
    A.append(int(input()))
score = [0]*N
init_score = [K]*N
for i in A:
    score[i] += 1
final_score = [init_score[i]-Q+score[i] for i in range(N)]
for i in final_score:
    print("Yes") if i > 0 else print("No")

Fixed code:
N, K, Q = map(int, input().split())
A = []
for i in range(Q):
    A.append(int(input()))
score = [0]*N
init_score = [K]*N
for i in A:
    score[i-1] += 1
final_score = [init_score[i]-Q+score[i] for i in range(N)]
for i in final_score:
    print("Yes") if i > 0 else print("No")
Buggy code:
n,k,q=map(int,input().split())
a=[(input()) for l in range(q)]
if q-k<0:
    for i in range(n):
        print('Yes')
else:
    c = collections.Counter(a)
    for i in range(n):
        if c[str(i+1)]>q-k:
            print('Yes')
        else:
            print('No')

Fixed code:
n,k,q=map(int,input().split())
a=[(input()) for l in range(q)]
#if q-k<0:
 #   for i in range(n):
  #      print('Yes')
#else:
import collections
c = collections.Counter(a)
for i in range(n):
    #print(k-c[str(i+1)])
    if q-c[str(i+1)]<k:
        print('Yes')
    else:
        print('No')
Buggy code:
import sys
import collections
stdin = sys.stdin

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))

N,K,Q=nm()
Al=[0]*N
for i in range(Q):
    Al[i]=ni()



for i in range(N):
    print('No' if (K-Q+Al.count(i+1)<1) else 'Yes')

Fixed code:
import sys
import collections
stdin = sys.stdin

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))

N,K,Q=nm()
Al=[0]*Q
ans_l=[K-Q]*N
for i in range(Q):
    #Al[i]=int(input())
    ans_l[int(input())-1]+=1
    


for i in range(N):
    #print(Al.count(i+1))
    #print('No' if (K-Q+Al.count(i+1)<1) else 'Yes')
    print('No' if (ans_l[i]<1) else 'Yes')
Buggy code:
n,k,q= map(int, input().split())
a = [0]*n
for i in range(q):
  a[int(input())-1]+=1
for i in range(n):
  if a[i]-q > 0:
    print("Yes")
  else:
    print("No")

Fixed code:
n,k,q = map(int, input().split())
a = [0]*n
for i in range(q):
  a[int(input())-1] += 1

for x in a:
  if k - q + x > 0:
    print("Yes")
  else:
    print("No")
Buggy code:
n,k,q=map(int,input().split())
need=q-k+1
anstimes=[0 for i in range(n)]
if k>q:
  print("Yes")
else:
  L = [int(input()) for i in range(q)]
  anstimes=[0 for i in range(n)]
  for i in range(q):
    anstimes[L[i]-1]+=1
  print(anstimes)
  for i in range(n):
    if anstimes[i]>=need:
      print("Yes")
    else:
      print("No")
  
  

Fixed code:
n,k,q=map(int,input().split())
need=q-k+1
anstimes=[0 for i in range(n)]
if k>q:
  for i in range(n):
    print("Yes")
else:
  L = [int(input()) for i in range(q)]
  anstimes=[0 for i in range(n)]
  for i in range(q):
    anstimes[L[i]-1]+=1
  for i in range(n):
    if anstimes[i]>=need:
      print("Yes")
    else:
      print("No")
Buggy code:
n,k,q =map(int,input().split())
ans=[0]*n
for i in range(q):
    a=int(input())
    ans[a-1]+=1
for i in range(n):
    if 0< ans[i]<=q-k and q-k>0:
        print("No")
    else:
        print("Yes")


Fixed code:
n,k,q =map(int,input().split())
ans=[0]*n
for i in range(q):
    a=int(input())
    ans[a-1]+=1
for i in range(n):
    if ans[i]<=q-k and q-k>=0:
        print("No")
    else:
        print("Yes")
Buggy code:
n,k,q =map(int,input().split())
ans=[0]*n
for i in range(q):
    a=int(input())
    ans[a-1]+=1
for i in range(n):
    if k+q-ans[i]>0:
        print("Yes")
    else:
        print("No")


Fixed code:
n, k, q = map(int, input().split())
anslist = [0] * n
ans = ["No"] * n
for i in range(q):
    a = int(input())
    anslist[a-1]+=1
for i in range(len(anslist)):
    if anslist[i] >= (q - k + 1):
        ans[i]="Yes"
[print(i) for i in ans]
Buggy code:
from collections import Counter

n, k, q = map(int,input().split())
if (k>q):
    for i in range(n):
        print('Yes')
A = []
for i in range(q):
    A.append(int(input()))
As = list(set(A))
S=Counter(A)
B = [k-q]*n
for k,v in S.items():
  B[k-1]+=v

for i in B:
  if(i>0):
    print('Yes')
  else:
    print('No')
  

Fixed code:
from collections import Counter

n, k, q = map(int,input().split())      
A = []
for i in range(q):
    A.append(int(input()))
As = list(set(A))
S=Counter(A)
B = [k-q]*n
for k,v in S.items():
  B[k-1]+=v

for i in B:
  if(i>0):
    print('Yes')
  else:
    print('No')
Buggy code:
n,k,q = map(int,input().split(' '))
ans = [k-q]*n
i = 0
while i < q:
    p = int(input())
    ans[p] += 1
    i += 1
str = ''
for a in ans:
    if a > 0:
        str += 'Yes\n'
    else:
        str += 'No\n'
print(str)

Fixed code:
n,k,q = map(int,input().split(' '))
ans = [k-q]*n
i = 0
while i < q:
    p = int(input())
    ans[p-1] += 1
    i += 1
str = ''
for a in ans:
    if a > 0:
        str += 'Yes\n'
    else:
        str += 'No\n'
print(str)
Buggy code:
N,K,Q=map(int,input().split())
L=[K-Q]*N
for j in range(N):
  A=int(input())
  L[A]+=1
for i in L:
  if i>0:
    print("Yes")
  else:
    print("No")

Fixed code:
N,K,Q=map(int,input().split())
L=[K-Q]*N
for j in range(1,Q+1):
  A=int(input())
  L[A-1]+=1
for i in L:
  if i>0:
    print("Yes")
  else:
    print("No")
Buggy code:
N,K,Q=map(int,input().split())
P=[K for _ in range(N)]
for i in range(N):
  P[int(input())-1]+=1
P=[j-Q for j in P]
for k in range(Q):
  if P[i]>0:
    print("Yes")
  else:
    print("No")

Fixed code:
N,K,Q=map(int,input().split())
P=[K for _ in range(N)]
for i in range(Q):
  P[int(input())-1]+=1
P=[j-Q for j in P]
for k in range(N):
  if P[k]>0:
    print("Yes")
  else:
    print("No")
Buggy code:
n,k,q=map(int,input().split())
a=[]
for _ in range(q):
  a.append(int(input()))
p=[-k]*n
for num in a:
  p[num-1] += 1
for num in p:
  if num > 0:
    print('Yes')
  else:
    print('No')


Fixed code:
n,k,q=map(int,input().split())
a=[]
for _ in range(q):
  a.append(int(input()))
p=[k-q]*n
for num in a:
  p[num-1] += 1
for num in p:
  if num > 0:
    print('Yes')
  else:
    print('No')
Buggy code:
n, k, q = map(int, input().split())

scores = [0 for i in range(n)]

for a in range(q):
    scores[a-1] += 1

for s in scores:
    if q - s >= k:
        print('No')
    else:
        print('Yes')

Fixed code:
n, k, q = map(int, input().split())

scores = [0 for i in range(n)]

for i in range(q):
    a = int(input())
    scores[a-1] += 1

for s in scores:
    if q - s >= k:
        print('No')
    else:
        print('Yes')
Buggy code:
from collections import Counter
N,K,Q = map(int,input().split())
A = [int(input()) for _ in range(Q)]
data = [K-Q]*N
C = Counter(A)
for i,j in C.items():
  data[i-1] += j
  print(i,j)
for i in range(N):
  if data[i] > 0:
    print("Yes")
  else:
    print("No")

Fixed code:
from collections import Counter
N,K,Q = map(int,input().split())
A = [int(input()) for _ in range(Q)]
data = [K-Q]*N
C = Counter(A)
for i,j in C.items():
  data[i-1] += j
for i in range(N):
  if data[i] > 0:
    print("Yes")
  else:
    print("No")
Buggy code:
n,k,q=map(int,input().split())
diff=q-k
count=[0]*n
arr=list(map(int,input().split()))
ans=['No']*n
for i in range(n):
  count[arr[i]-1]+=1
for i in range(n):
  if count[i]>=diff:
    ans[i]='Yes'
  print(ans[i])

Fixed code:
n,k,q=map(int,input().split())
diff=q-k
count=[0]*n
arr=[int(input()) for _ in range(q)]
ans=['No']*n
for i in range(q):
  count[arr[i]-1]+=1
for i in range(n):
  if count[i]>diff:
    ans[i]='Yes'
  print(ans[i])
Buggy code:
import itertools
##print(ord("A"))
#n = int(input())
n,k,q = map(int,input().split())
#h = list(map(int,input().split()))	
ans_list=[input() for i in range(q)]
pnt_list = [k]*n
#print(pnt_list)
for i in range(q):
    print(pnt_list)
    for j in range(n):
    
        if ans_list[i]==str(j+1):
            pass
        else:
            pnt_list[j]=pnt_list[j]-1
for i in range(len(pnt_list)):
    if pnt_list[i]>0:
        print("Yes")
    else:
        print("No")
#print(pnt_list)

Fixed code:
import itertools
##print(ord("A"))
#n = int(input())
n,k,q = map(int,input().split())
#h = list(map(int,input().split()))	
ans_list=[input() for i in range(q)]
pnt_list = [k-q]*n
#print(pnt_list)
for i in range(q):

    pnt_list[int(ans_list[i])-1]+=1
#print(pnt_list)
for i in range(len(pnt_list)):
    if pnt_list[i]>0:
        print("Yes")
    else:
        print("No")
Buggy code:
N,K,Q = map(int,input().split())
A = [0]*N
for i in range(N):
    a = int(input())
    A[a-1] += 1
for i in range(N):
    x = K+A[i]-Q
    if X > 0:
        print('Yes')
    else:
        print('No')
    

Fixed code:
N,K,Q = map(int,input().split())
A = [0]*N
for i in range(Q):
    a = int(input())
    A[a-1] += 1
for i in range(N):
    x = K+A[i]-Q
    if x > 0:
        print('Yes')
    else:
        print('No')
Buggy code:
x,y,z = map(int,input().split())
 
dp = [y-z for i in range(x)]

for j in range(z):
    k = int(input())
    dp[k-1] =+ 1

for l in dp:
    if l >= 1:
        print("Yes")
    else:
        print("No")

Fixed code:
x,y,z = map(int,input().split())
 
dp = [y-z for i in range(x)]
 
for j in range(z):
    k = int(input())
    dp[k-1] += 1
 
for l in dp:
    if l >= 1:
        print("Yes")
    else:
        print("No")
Buggy code:
N,K,Q=map(int, input().split())
A=[int(input()) for i in range(Q)]
from collections import Counter
A=Counter(A)
B=list(A.most_common())
B.sort(key=lambda x:x[0])
for i in range(N):
  if (Q - B[i][1])< K:
    print("Yes")
  else:
    print("No")

Fixed code:
N,K,Q=map(int, input().split())
A=[int(input()) for i in range(Q)]
from collections import Counter
A=Counter(A)
B=list(A.most_common())
#B.sort(key=lambda x:x[0])
C = [0]*N
for i in B:
  C[i[0]-1]=i[1]
for i in range(N):
  if (Q - C[i])< K:
    print("Yes")
  else:
    print("No")
Buggy code:
N,K,Q=map(int,input().split())
QL=[0]*Q
NL=[K-Q]*N
for i in range(Q):
  L[i]=int(input())
  NL[L[i]]+=1
for i in range(N):
  print('Yes' if NL[i]>0 else 'No')
  

Fixed code:
N,K,Q=map(int,input().split())
QL=[0]*Q
NL=[K-Q]*N
for i in range(Q):
  QL[i]=int(input())-1
  NL[QL[i]]+=1
for i in range(N):
  print('Yes' if NL[i]>0 else 'No')
Buggy code:
a, b, c = map(int, input().split())
array = []
for i in range(c):
	array.append(input())
 
point = [b] * a
 
for i in range(c):
	for j in range(a):
		if j+1 != int(array[c]):
			point[j] = point[j] -1
            
for i in range(a):
	if point[i] > 0:
		print('Yes')
	else:
		print('No')

Fixed code:
a, b, c = map(int, input().split())
array = []
for i in range(c):
	array.append(int(input()))

point = [b] * a
 
for i in range(c):
	point[array[i]-1] = point[array[i]-1] + 1
            
for i in range(len(point)):
	if (point[i]-c) > 0 :
		print('Yes')
	else:
		print('No')
Buggy code:
N, K, Q = map(int, input().split())
A = [K] * N
B = []

for i in range(Q):
    B.append(int(input()))

for s in range(N):
    if (A[s] - Q - B.count(s+1)) > 0:
        print('Yes')
    else:
        print('No')


Fixed code:
N, K, Q = map(int, input().split())
A = [0] * N
B = []

for i in range(Q):
    a = int(input())
    A[a-1] += 1

for s in range(N):
    if A[s] > Q - K:
        print('Yes')
    else:
        print('No')
Buggy code:
n,k,q = map(int, input().split())
a = [int(input()) for _ in range(q)]
p = [0]*n
for i in range(n):
    p[i]=a.count(i+1)
    if k>q:
        print('Yes')
    if k+p[i]-q<=0:
        print('No')
    else:
        print('Yes')


Fixed code:
n,k,q = map(int, input().split())
a = [int(input()) for _ in range(q)]

p = [k-q]*(n)
for i in a:
    p[i-1] +=1

for i in range(n):
    if p[i]>0:
        print('Yes')
    else:
        print('No')
Buggy code:
import numpy as np
n, k, q = map(int, input().split())
points = np.full(n, k)
minus = np.full(n)
for i in range(q):
    a = int(input())
    points = np.array(points) + np.array(minus)
    points[a - 1] += 1
for point in points:
    if point > 0:
        print("Yes")
    else:
        print("No")

Fixed code:
import numpy as np
n, k, q = map(int, input().split())
points = np.full(n, k)
z = np.full(n, 0)
points = points - q
for i in range(q):
    a = int(input())
    z[a - 1] += 1
points = points + z
for point in points:
    if point > 0:
        print("Yes")
    else:
        print("No")
Buggy code:
# coding: UTF-8
import sys
#sys.setrecursionlimit(n)
import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *

readl= lambda: list(map(int, sys.stdin.readline().split()))
readt= lambda: tuple(map(int, sys.stdin.readline().split()))
read = lambda: sys.stdin.readline().rstrip()
readi = lambda: int(read())
readmi = lambda: map(int, sys.stdin.readline().split())
readms = lambda: map(str, sys.stdin.readline().split())

n,k,q = readmi()
t = [0] * n
for i in range(q):
    s = readi()
    t[s - 1] += 1
print(t)
for i in t:
    p = k - q + i
    if p >= 1:
        print("Yes")
    else:
        print("No")


Fixed code:
# coding: UTF-8
import sys
#sys.setrecursionlimit(n)
import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *

readl= lambda: list(map(int, sys.stdin.readline().split()))
readt= lambda: tuple(map(int, sys.stdin.readline().split()))
read = lambda: sys.stdin.readline().rstrip()
readi = lambda: int(read())
readmi = lambda: map(int, sys.stdin.readline().split())
readms = lambda: map(str, sys.stdin.readline().split())

n,k,q = readmi()
t = [0] * n
for i in range(q):
    s = readi()
    t[s - 1] += 1
for i in t:
    p = k - q + i
    if p >= 1:
        print("Yes")
    else:
        print("No")
Buggy code:
N, K, Q = map(int, input().split())
P = [0 for i in '0'*N]
for n in '0'*Q:
    A = int(input()) - 1
    P[A] += 1
print(P)
for s in map(lambda x:'Yes' if x-Q+K>0 else 'No', P):
    print(s)

Fixed code:
N, K, Q = map(int, input().split())
P = [0 for i in '0'*N]
for n in '0'*Q:
    A = int(input()) - 1
    P[A] += 1
for s in map(lambda x:'Yes' if x-Q+K>0 else 'No', P):
    print(s)
Buggy code:
n,k,q=map(int,input().split())
a=[k]*n
for i in range(q):
  o=int(input())
  a[o-1]+=2
  for j in range(n):
    a[j]-=1

for s in range(n):
  if a[s]>0:
    print("Yes")
  else:
    print("No")

Fixed code:
n,k,q=map(int,input().split())
a=[k-q]*n
for i in range(q):
  o=int(input())
  a[o-1]+=1
  

for s in range(n):
  if a[s]>0:
    print("Yes")
  else:
    print("No")
Buggy code:
N,K,Q = map(int, input().split())

P = [0] * N


 
for i in range(Q):
	A = int(input())
	P[A-1] += 1


for j in range(0,len(P)):
	if K - Q + P[j] > 0:
		print('Yes')
	else:
		print('No')
print(P)

Fixed code:
N,K,Q = map(int, input().split())

P = [0] * N


for i in range(Q):
	A = int(input())
	P[A-1] += 1


for j in range(0,len(P)):
	if K - Q + P[j] > 0:
		print('Yes')
	else:
		print('No')
Buggy code:
import numpy as np

n = list(map(int, input().split()))

if n[1] > n[2]:
    for c in range(n[0):
            print('Yes')
else:
    a = []

    for i in range(n[2]):
        a.append(int(input()))

    m = [n[1]]*n[0]

    x = np.array(m)
    for j in range(n[2]):
        x -= 1
        x[a[j]-1] += 1

    for num in range(n[0]):
        if x[num] <= 0:
            print('No')
        else:
            print('Yes')



Fixed code:
import numpy as np

n = list(map(int, input().split()))

a = []

for i in range(n[2]):
    a.append(int(input()))

if n[1] > n[2]:
    for c in range(n[0]):
            print('Yes')

else:
    m = [n[1]]*n[0]

    x = np.array(m)
    x -= n[2]
    for j in range(n[2]):
        x[a[j]-1] += 1

    for num in range(n[0]):
        if x[num] <= 0:
            print('No')
        else:
            print('Yes')
Buggy code:
n,k,q = map(int,input().split())

p = [k]*n
a = [0]*q

for i in range(0,q):
  a[i] = int(input())

for i in range(0,q):
  for j in range(0,n):
    p[j] -= 1
  p[a[i]-1] += 1
  #print(a[i])
  
for i in range(0,n):
  if(p[i] <= 0):
    print("No")
  else:
    print("yes")
  

Fixed code:
n,k,q = map(int,input().split())

p = [k]*n
a = [0]*q

for i in range(0,q):
  a[i] = int(input())

for i in range(0,n):
  p[i] = p[i] - q
for i in range(0,q):
  p[a[i]-1] += 1

#print(p)

for i in range(0,n):
  if(p[i] <= 0):
    print("No")
  else:
    print("Yes")
Buggy code:
from collections import Counter
n,k,q = map(int,input().split())
a = [int(input) for _ in range(n)]
a = Counter(a)
for i in range(1,n+1):
    if a[i] > q-k:
        print('Yes')
    else:
        print('No')

Fixed code:
from collections import Counter
n,k,q = map(int,input().split())
a = [int(input()) for _ in range(q)]
a = Counter(a)
for i in range(1,n+1):
    if a[i] > q-k:
        print('Yes')
    else:
        print('No')
Buggy code:
N, K, Q = [int(x) for x in input().split()]

scores = [K] * N
for i in range(Q):
    ans = int(input())
    scores[ans - 1] += 1
    

for score in scores:
    print('Yes' if score > 0 else 'No')


Fixed code:
N, K, Q = [int(x) for x in input().split()]

scores = [K - Q] * N
for i in range(Q):
    ans = int(input())
    scores[ans - 1] += 1
    

for score in scores:
    print('Yes' if score > 0 else 'No')
Buggy code:
import collections
def main():
    li = list(map(int,input().split()))
    respondents = [int(input()) for i in range(li[2])]
    number_of_respondes = respondes_number_of_participants(respondents)
    print(number_of_respondes)
    check_surviver(number_of_respondes,li[0],li[1],li[2])


def respondes_number_of_participants(respondents):
    return collections.Counter(respondents)


def check_surviver(number_of_respondes,number_of_participants,gived_points,number_of_questions):
    for i in range(number_of_participants):
        if number_of_respondes[i+1]:
            if gived_points - number_of_questions + number_of_respondes[i+1] > 0:
                print("Yes")
            else:
                print("No")
        else:
            if gived_points - number_of_questions > 0:
                print("Yes")
            else:
                print("No")

main()

Fixed code:
import collections
def main():
    li = list(map(int,input().split()))
    respondents = [int(input()) for i in range(li[2])]
    number_of_respondes = respondes_number_of_participants(respondents)
    check_surviver(number_of_respondes,li[0],li[1],li[2])


def respondes_number_of_participants(respondents):
    return collections.Counter(respondents)


def check_surviver(number_of_respondes,number_of_participants,gived_points,number_of_questions):
    for i in range(number_of_participants):
        if number_of_respondes[i+1]:
            if gived_points - number_of_questions + number_of_respondes[i+1] > 0:
                print("Yes")
            else:
                print("No")
        else:
            if gived_points - number_of_questions > 0:
                print("Yes")
            else:
                print("No")

main()