qyliang/CodeNanoFix huggingface dataset:
Buggy code:
n, k, q = list(map(int,input().split(' ')))
import numpy as np
point =np.full(k, n)
for i in range(q):
  point-=1
  point[int(input())-1]+=1

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


Fixed code:
n, k, q = list(map(int,input().split(' ')))
import numpy as np
point =np.full(n,k-q)
for i in range(q):
  win = int(input())
  point[win-1]+=1
  
  
#print(np.where(point>0,'Yes','No'))
for i in point:
  if i>0:
    print('Yes')
  else:
    print('No')
Buggy code:
str = input()

split = str.split(" ")

Member = int(split[0])
Point = int(split[1])
Ans = int(split[2])
MemPoint = [0 for i in range(Member)]

for i in range(Ans):
  MemPoint[int(input())-1] += 1

maxNum = max(MemPoint)
for i in range(Member):
  if maxNum == MemPoint[i]:
    print("Yes")
  else:
    print("No")

Fixed code:
str = input()

split = str.split(" ")

Member = int(split[0])
Point = int(split[1])
Ans = int(split[2])
MemPoint = [0 for i in range(Member)]

for i in range(Ans):
  MemPoint[int(input())-1] += 1

for i in range(Member):
  if Point - (Ans - MemPoint[i]) > 0:
    print("Yes")
  else:
    print("No")
Buggy code:
n, k, q = map(int, input().split())
a = [int(input()) for _ in range(q)]
p = k - q
s = [[i, p] for i in range(n)]
for i in a:
    s[i][1] += 1

for i in s:
    if i[1] < 1:
        print("No")
    else:
        print("Yes")


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

for i in s:
    if i < 1:
        print("No")
    else:
        print("Yes")
Buggy code:
sin = input()
n, k, q = map(int, sin.split())

sei = [0] * n
for i in range(q):
    sei[int(input()) -1] += 1

print(sei)
for ss in sei:
    if k + ss - q > 0:
        print('Yes')
    else:
        print('No')

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

sei = [0] * n
for i in range(q):
    sei[int(input()) -1] += 1

for ss in sei:
    if k + ss - q > 0:
        print('Yes')
    else:
        print('No')
Buggy code:
N, K, q=map(int, input().split())
score=[0]*N

for i in range(q):
    score[q-1]+=1

for i in range(N):
    if score[i]-K<=0:
        print("No")
    else:
        print("Yes")

Fixed code:
N, K, q=map(int, input().split())
score=[0]*N

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

for i in range(N):
    if K-(q-score[i])>0:
        print("Yes")
    else:
        print("No")
Buggy code:
X = list(map(int, input().split()))
N = [X[1]-X[2]]*X[0]
Q = []
for i in range(X[2]):
  Q.append(int(input()))
for i in range(X[2]):
  N[Q[i]]+=1
for result in N:
  if(result >= 1):
    print('Yes')
  else:
    print('No')

Fixed code:
X = list(map(int, input().split()))
N = [X[1]-X[2]]*X[0]
Q = []
for i in range(X[2]):
  Q.append(int(input()))
for i in range(X[2]):
  N[Q[i]-1]+=1
for result in N:
  if(result >= 1):
    print('Yes')
  else:
    print('No')
Buggy code:
N,K,Q = map(int, input().split())
A = [int(input()) for i in range(Q)]
B = [K for i in range(N)]
for x in A:
  B[x-1] += 1
for x in B:
  k = Q - x
  if K - k + x > 0:
    print("Yes")
  else:
    print("No")


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

A = [0]*Q
for i in range(Q):
    A[i] = int(input())

B = [0]*N

for i in range(Q):
    B[A[i] - 1] += 1


for i in range(N):
    if K - (Q - B[i]) > 0:
        print("Yes")
    else:
        print("No")
Buggy code:
# -*- coding: utf-8 -*-
"""
Created on Thu Mar 12 22:54:45 2020

@author: Kanaru Sato
"""

n,k,q = list(map(int, input().split()))
dict = {}

for i in range(q):
    ans = input()
    if ans not in dict:
        dict[ans] = 1
    else:
        dict[ans] += 1

points = []

for i in range(1,n+1):
    if str(i) in dict and dict[str(i)]+k-q>0:
        points.append("Yes")
    else:
        points.append("No")

for i in range(n):
    print(points[i])

Fixed code:
# -*- coding: utf-8 -*-
"""
Created on Thu Mar 12 22:54:45 2020

@author: Kanaru Sato
"""

n,k,q = list(map(int, input().split()))
dict = {}

for i in range(q):
    ans = input()
    if ans not in dict:
        dict[ans] = 1
    else:
        dict[ans] += 1

points = []

for i in range(1,n+1):
    if k-q>0:
        points.append("Yes")
    elif str(i) in dict and dict[str(i)]+k-q>0:
        points.append("Yes")
    else:
        points.append("No")

for i in range(n):
    print(points[i])
Buggy code:
n,k,q=map(int,input().split())
A=[]
A=[int(input()) for i in range(q)]
B=[]
for i in range(q):
    B.append(-q)
for i in A:
    B[i-1]+=1
for i in range(q):
    if B[i]<=0:
        B[i]='No'
    else:
        B[i]='Yes'
C="\n".join(B)
print(C)

Fixed code:
n,k,q=map(int,input().split())
A=[]
A=[int(input()) for i in range(q)]
#print(A)
B=[]
for i in range(n):
    B.append(-q+k)
#print(B)
for i in A:
    B[i-1]+=1
for i in range(n):
    if B[i]<=0:
        B[i]='No'
    else:
        B[i]='Yes'
C="\n".join(B)
print(C)
Buggy code:
N, K, Q = map(int,input().split())

if K > Q:
    ans = ["Yes" for i in range(N)]
print(ans)
exit()

T = [0 for i in range(N)]
t = Q - K

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

for i in range(N):
    if T[i] > t:
         print("Yes")
    else:
        print("No")

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

if K > Q:
	for i in range(N):
		print("Yes")
	exit()

T = [0 for i in range(N)]
t = Q - K

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

for i in range(N):
    if T[i] > t:
         print("Yes")
    else:
        print("No")
Buggy code:
import collections
N,K,Q = map(int,input().split())

A=[]
for i in range(Q):
    A.append(int(input()))
    
jud = Q - K

ans_list = [0] * N

c = collections.Counter(A)
val = list(c.values())
key = list(c.keys())

for i in range(len(c)):
    if val[i] > jud:
        ans_list[key[i]-1] +=1
for i in range(N):
    if ans_list[i] > 0:
        print("Yes")
    else:
        print("No")

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

A=[]
for i in range(Q):
    A.append(int(input()))
    
jud = Q - K

ans_list = [0] * N

c = collections.Counter(A)
key = list(c.keys())
val = list(c.values())
for i in range(len(c)):
  ans_list[key[i]-1] = val[i]

for i in range(len(c)):
    if val[i] > jud:
        ans_list[key[i]-1] +=1
for i in range(N):
    if ans_list[i] > jud:
        print("Yes")
    else:
        print("No")
Buggy code:
n,k,q=map(int,input().split())
a=[0]*n 
for i in range(q):
    t=int(input())
    a[t-1]+=1
print(a)
for i in a:
    if k-(q-i)>0:
        print("Yes")
    else:
        print("No")

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

ans = ['yes' if K + v - Q > 0 else 'No' for v in l]

for a in ans:
    print(a)

Fixed code:
N, K, Q = [int(n) for n in input().split()]
l = [0] * N
for i in range(Q):
    l[int(input())-1] += 1

ans = ['Yes' if K + v - Q > 0 else 'No' for v in l]

for a in ans:
    print(a)
Buggy code:
import sys
from collections import Counter
N, K, Q = map(int, input().split())
if K > Q:
    for _ in range(N):
        print("Yes")
        sys.exit()

result = ["No"]*N
Npoint = [K-Q]*N

Alist = [int(input())-1 for _ in range(Q)]
Alist = Counter(Alist)

for k, v in Alist.items():
    Npoint[k] += v
    if Npoint[k] >= 1:
        result[k] = "Yes"

for i in result:
    print(i)


Fixed code:
import sys
from collections import Counter
N, K, Q = map(int, input().split())

result = ["No"]*N
Npoint = [K-Q]*N

Alist = [int(input())-1 for _ in range(Q)]

if K > Q:
    for _ in range(N):
        print("Yes")
    sys.exit()

Alist = Counter(Alist)

for k, v in Alist.items():
    Npoint[k] += v
    if Npoint[k] >= 1:
        result[k] = "Yes"

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


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

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

Fixed code:
n,k,q = map(int,input().split())
L = [int(input()) for i in range(q)]
P = [k - q for i in range(n)]

     
for i in range(q):
      P[L[i] - 1] += 1

for i in range(n):      
      if P[i] > 0:
            print("Yes")
      else:
            print("No")
Buggy code:
import numpy as np
#from itertools import combinations as comb
#from itertools import combinations_with_replacement as comb_with

#A = int(input())
N,K,Q= map(int,input().split())
#A = list(map(int,input().split()))
#B = list(map(int,input().split()))
#S= str(input())
l=np.zeros(N)
l+=K
print(l)
for m in range(Q):
    A = int(input())
    l-=1
    l[A-1]+=1
    print(l)
for i in l:
    if i<=0:
        print('No')
    else:
        print('Yes')


Fixed code:
import numpy as np
#from itertools import combinations as comb
#from itertools import combinations_with_replacement as comb_with

#A = int(input())
N,K,Q= map(int,input().split())
#A = list(map(int,input().split()))
#B = list(map(int,input().split()))
#S= str(input())
l=np.zeros(N)
l+=(K-Q)
#print(l)
for m in range(Q):
    A = int(input())
    l[A-1]+=1
#    print(l)
l=np.where(l<1,'No','Yes')
for i in l:
    print(i)
Buggy code:
import sys

# def calc_minus1(n):
#     n-=1
#     return n

A = [int(x) for x in input().split()]
#print(AB)
N = A[0]
K = A[1]
Q = A[2]
B = K - Q
a = [B]*N
#print(a)
for i in range(Q):
 #   print(i)
    n = int(input())
    #print(n)
    #print(a)
    a[n-1]+=1
    #print(a)

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

Fixed code:
import sys

# def calc_minus1(n):
#     n-=1
#     return n

A = [int(x) for x in input().split()]
#print(AB)
N = A[0]
K = A[1]
Q = A[2]
B = K - Q
if K > Q:
    for i in range(Q):
        n = int(input())
    for i in range(N):
        print('Yes')
    sys.exit()
a = [B]*N
#print(a)
for i in range(Q):
 #   print(i)
    n = int(input())
    #print(n)
    #print(a)
    a[n-1]+=1
    #print(a)

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


for i in range(q):
  b[a[i]]+=1

for i in range(n):
  if k-n+b[i]>0:
    print("Yes")
  else
    print("No")


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

for i in range(q):
    p = list(map(lambda x:x-1, p))
    p[a[i]] += 1

      
for n in p:
  if n>0:
    print("Yes")
  else:
    print("No")


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

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

for i in range(q):
    p[a[i]] += 1

      
for n in p:
  if n>0:
    print("Yes")
  else:
    print("No")

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

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

correct = [0]*N

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

print(correct)

for i in range(N):
    score = K - (Q-correct[i])
    if score <= 0:
        print("No")
    else:
        print("Yes")

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

correct = [0]*N

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


for i in range(N):
    score = K - (Q-correct[i])
    if score <= 0:
        print("No")
    else:
        print("Yes")
Buggy code:
n,k,q = list(map(int, input().split()))
winners = [int(input()) for i in range(q)]
pts = [0]*n
for i in winners:
    pts[i-1] +=1
final_pts = []
for i in range(n):
    final_pts.append(k-4+pts[i])
for i in final_pts:
    if i > 0:
        print('Yes')
    else:
        print('No')


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

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

p_n = [k-q for i in range(n)]

for a_i in a_n:
    p_n[a_i] += 1

[print("Yes") if p_i > 0 else print("No") for p_i in p_n]


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

p_n = [k-q for i in range(n)]

for a_i in a_n:
    p_n[a_i-1] += 1

[print("Yes") if p_i > 0 else print("No") for p_i in p_n]
Buggy code:
N,K,Q = map(int, input().split())
score_lst = [0] * N

for i in range(Q):
    Ai = input()
    score_lst[Ai - 1] += 1

def_socre = K - Q
for j in score_lst:
    if def_socre + j > 0:
        print("Yes")
    else:
        print("No")


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

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

def_socre = K - Q
for j in score_lst:
    if def_socre + j > 0:
        print("Yes")
    else:
        print("No")
Buggy code:
INPUT = [int(i) for i in input().split(" ")]

N = INPUT[0]
K = INPUT[1]
Q = INPUT[2]
#print(INPUT)
A = []
for i in range(Q):
        A.append(int(input()))
print(A)

P = [K]*N
print(P)
for a in A:
    for i in range(len(P)):
        P[i] = P[i] - 1
    P[a-1] = P[a-1] + 1

#print(P)

for i in P:
    if(i >= 1):
        print("Yes")
    else:
        print("No")
    

Fixed code:
INPUT = [int(i) for i in input().split(" ")]

N = INPUT[0]
K = INPUT[1]
Q = INPUT[2]
#print(INPUT)
A = []
for i in range(Q):
        A.append(int(input()))
#print(A)

P = [K]*N
#print(P)
for i in range(len(P)):
    P[i] = P[i] - Q

for i in A:
    P[i-1] = P[i-1] + 1
    

#print(P)

for i in P:
    if(i >= 1):
        print("Yes")
    else:
        print("No")
Buggy code:
N,K,Q = list(map(int, input().split()))

if(K>Q):
    for x in range(N):
        print("Yes")

a=[]
nScore=[]

for x in range(N):
    nScore.append(0)

for x in range(Q):
    nScore[int(input())-1]+=1

for x in range(N):
    if K-Q+nScore[x]>0:
        print("Yes")
    else:
        print("No")





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



a=[]
nScore=[]

for x in range(N):
    nScore.append(0)

for x in range(Q):
    nScore[int(input())-1]+=1

# if(K>Q):
#     for x in range(N):
#         print("Yes")

for x in range(N):
    if K-Q+nScore[x]>0:
        print("Yes")
    else:
        print("No")
Buggy code:
N, K, Q = map(int, input().split())
A = []
for _ in range(Q):
    A.append(input())
    
a = 1 - (K - Q)
score = [0] * N

for i in range(len(A)):
  b = A[i]
  score[b-1] += 1

for j in range(len(score)):
  if score[j] >= a:
    print('Yes')
  else:
    print('No')

Fixed code:
N, K, Q = map(int, input().split())
A = []
for _ in range(Q):
    A.append(int(input()))
    
a = 1 - (K - Q)
score = [0] * N

for i in range(len(A)):
  b = A[i]
  score[b-1] += 1

for j in range(len(score)):
  if score[j] >= a:
    print('Yes')
  else:
    print('No')
Buggy code:
a = input().split(" ")
mem = [0] * int(a[0])
for i in range(int(a[2])):
  mem[int(input())-1] += 1
for i in mem:
  if int(a[1])-int(a[2])+mem[i] < 1:
    print("No")
  else:
    print("Yes")

Fixed code:
a = input().split(" ")
mem = [0] * int(a[0])
for i in range(int(a[2])):
  mem[int(input())-1] += 1
for i in range(int(a[0])):
  if int(a[1])-int(a[2])+mem[i] < 1:
    print("No")
  else:
    print("Yes")
Buggy code:
str_list = input().split(' ')
int_list = [int(x) for x in str_list]
N, K, Q = int_list[0], int_list[1], int_list[2]
A = []
for _ in range(Q):
    A.append( int(input()) )
point = [int(K)]*N
import numpy as np
point = np.array(point)
for ii in range(Q):
    point[A[ii]-1] += 1
point -= -Q
for ii in range(N):
    if point[ii] <= 0:
        print('No')
    else:
        print('Yes')


Fixed code:
str_list = input().split(' ')
int_list = [int(x) for x in str_list]
N, K, Q = int_list[0], int_list[1], int_list[2]
A = []
for _ in range(Q):
    A.append( int(input()) )
point = [int(K)]*N
import numpy as np
point = np.array(point)
for ii in range(Q):
    point[A[ii]-1] += 1
point -= Q
for ii in range(N):
    if point[ii] <= 0:
        print('No')
    else:
        print('Yes')
Buggy code:
import sys
input = sys.stdin.readline

n, k, q = [int(w) for w in input().split()]


score = [0] * n

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

for s in score:
    cond = k - q + a > 0
    print("Yes" if cond else "No")


Fixed code:
import sys
input = sys.stdin.readline

n, k, q = [int(w) for w in input().split()]


score = [0] * n

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


for s in score:
    print('Yes' if s + k - q > 0 else 'No')
Buggy code:
N, K, Q = map(int,input().split())

A = [int(input()) for _ in range(Q)]

Point = [ 0 for _ in range(Q)]

for a in A:
    Point[a-1] += 1

for p in Point:
    if K - (K - p) > 0:
        print("Yes")
    else:
        print("No")

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

A = [int(input()) for _ in range(Q)]

Point = [ 0 for _ in range(N)]

if K-1 >= Q:
    for _ in range(N):
        print("Yes")

else:
    for a in A:
        Point[a-1] += 1

    for p in Point:
        if K - Q + p > 0:
            print("Yes")
        else:
            print("No")
Buggy code:
n,k,q=map(int,input().split())
l=[]
for i in range(n):
  v=[i,0]
  l.append(v)
for j in range(q):
  p=int(input())
  l[p-1][1]+=1
for l in range(n):
  if l[l][1]>q-k:
    print('Yes')
  else:
    print('No')

Fixed code:
n,k,q=map(int,input().split())
l=[]
for i in range(n):
  v=[i,0]
  l.append(v)
for j in range(q):
  p=int(input())
  l[p-1][1]+=1
for m in range(n):
  if l[m][1]>q-k:
    print('Yes')
  else:
    print('No')
Buggy code:
import sys
input = sys.stdin.readline
import collections

n, k, q = map(int, input().split(' '))
t = [int(input()) for i in range(q)] 
 
ans = [k - q] * n

t_cnt = collections.Counter(t)
for i, j in t_cnt.items():
  ans[i] += j
    
for i in ans:
  if i > 0:
    print('Yes')
  else:
    print('No')

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

n, k, q = map(int, input().split(' '))
t = [int(input()) for i in range(q)] 
 
ans = [k - q] * n

t_cnt = collections.Counter(t)
for i, j in t_cnt.items():
  ans[i-1] += j

for i in ans:
  if i > 0:
    print('Yes')
  else:
    print('No')
Buggy code:
V = input().split()
N = int(V[0])
K = int(V[1])
Q = int(V[2])
A = [0 for i in range(Q)]
P = [K for i in range(N)]
for i in range(Q):
    A[i] = int(input())

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

for i in range(N):
    if P[i] <= Q:
        print("No")
    if P[i] > Q:
        print("Yes")

Fixed code:
V = input().split()
N = int(V[0])
K = int(V[1])
Q = int(V[2])
A = [0 for i in range(Q)]
P = [K for i in range(N)]
for i in range(Q):
    A[i] = int(input())

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

for i in range(N):
    if P[i] - Q <=0:
        print("No")
    if P[i] - Q > 0:
        print("Yes")
Buggy code:
n, k, q = (int(i) for i in input().split())
x = [0]*n
for i in range(q):
    a = int(input()) - 1
    x[a] = x[a] + 1

if q < k:
    for i in range(n):
        print('Yes')

for i in range(n):
    if k - q + x[i] > 0:
        print('Yes')
    else:
        print('No')


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

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

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

if k-q > 0:
    for _ in range(n):
        print('Yes')

for i in range(n):
    if point[i] > 0:
        print('Yes')
    else:
        print('No')

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

Fixed code:
n, k, q = map(int, input().split())
ar = [k for i in range(n)]
for i in range(q):
  index = int(input())
  ar[index-1] += 1
for i in range(n):
  if ar[i] - q > 0:
    print("Yes")
  else:
    print("No")
Buggy code:
def i():
	return int(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())

n,k,q = i2()
ls = [k-q]*n 
for _ in range(q):
	a = i()
	ls[a-1] += 1 

for _ in range(n):
	if ls[j] > 0:
		print("Yes")
	else:
		print("No")

Fixed code:
def i():
	return int(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())

n,k,q = i2()
ls = [k-q]*n 
for _ in range(q):
	a = i()
	ls[a-1] += 1 

for j in range(n):
	if ls[j] > 0:
		print("Yes")
	else:
		print("No")
Buggy code:
import numpy as np

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

for i in range(0,n):
  a[i] = k - a[i]
  if a[i] >= q:
    print("No")
  else:
    print("Yes")

Fixed code:
import numpy as np

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

for i in range(0,n):
  a[i] = q - a[i]
  if a[i] >= k:
    print("No")
  else:
    print("Yes")
Buggy code:
import numpy as np

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

A = []
answer = np.array([0]*N)
score = np.array([K]*N)

for _ in range(Q):
    A.append(int(input())-1)

for a in A:
    answer[a] += 1

print(answer)
answer = K - (Q - answer)

print(answer)
ans = np.where(answer>0, True, False)

print(ans)
for x in ans:
    if x:
        print("Yes")

    else:
        print("No")

Fixed code:
import numpy as np

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

A = []
answer = np.array([0]*N)
score = np.array([K]*N)

for _ in range(Q):
    A.append(int(input())-1)

for a in A:
    answer[a] += 1

answer = K - (Q - answer)

ans = np.where(answer>0, True, False)

for x in ans:
    if x:
        print("Yes")

    else:
        print("No")
Buggy code:
num,k,q = map(int,input().split())

arr = [0]*num


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

print(arr)
arr = [i-(q-k) for i in arr]

for i in range(len(arr)):
    if arr[i] > 0:
        print("Yes")
    else:
        print("No")
    

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

arr = [0]*num


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

arr = [i-(q-k) for i in arr]

for i in range(len(arr)):
    if arr[i] > 0:
        print("Yes")
    else:
        print("No")