qyliang/CodeNanoFix huggingface dataset:
Buggy code:
N,K,Q = map(int,input().split())
A = []
for _ in range(Q):
  A.append(int(input()))
point_list = [K-Q] * N
for i in range(Q):
  point_list[A[i]-1] += 1
for ii in range(N):
  if point_list[ii] > 0 :
    print('yes')
  else :
    print('No')

Fixed code:
N,K,Q = map(int,input().split())
A = []
for _ in range(Q):
  A.append(int(input()))
point_list = [K-Q] * N
for i in range(Q):
  point_list[A[i]-1] += 1
for ii in range(N):
  if point_list[ii] > 0 :
    print('Yes')
  else :
    print('No')
Buggy code:
sankaNum, scoreMax, ansCnt = map(int, input().split())

score = [0]*sankaNum

for n in range(ansCnt):
    ansSanka = input()
    score[int(input()) - 1] +=  1
    
for m in range(sankaNum):

    if scoreMax - score[m] > 0:
        print('Yes')
    else:
        print('No')

Fixed code:
sankaNum, scoreMax, ansCnt = map(int, input().split())

score = [scoreMax-ansCnt]*sankaNum

for _ in range(ansCnt):
    score[int(input()) - 1] +=  1

for m in range(sankaNum):

    if  score[m] > 0:
        print('Yes')
    else:
        print('No')
Buggy code:
N, K, Q = input().split()
N = int(N)
K = int(K)
Q = int(Q)

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

people = []
for i in range(N):
    people.append(K-Q)

for index, value in enumerate(people):
    for i in A:
        if index - 1 == i:
            people[index] += 1

for i in people:
    if i <= 0:
        print("No")
    else:
        print("Yes")


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

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

people = []
for i in range(N):
    people.append(K - Q)

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

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

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


Fixed code:
N,K,Q = map(int,input().split())
ANS = [0] * N
A = [int(input()) for _ in range(Q)]
for a in A:
  ANS[a-1] += 1
  
R = []
for i in range(N):
  p = K - Q + ANS[i]
  if p <= 0:
    R.append('No')
  else:
    R.append('Yes')
    
print('\n'.join(R))
Buggy code:
N,K,Q = map(int,input().split())
ANS = [0] * N
A = [int(input()) for _ in range(Q)]
for a in A:
  ANS[a-1] += 1
  
for i in range(N):
  p = K - Q + A[i]
  if p <= 0:
    print('No')
  else:
    print('Yes')
    
exit()


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

n,k,p = map(int, input().split())
each_point = []
for i in range(n):
  each_point.append(k-q)
 
for j in range(q):
  each_point[int(input())-1] += 1
 
for x in range(n):
  if (each_point[x] < 1):
    print("No")
  else:
    print("Yes")

Fixed code:
# inp1 = input()
# n = int(inp1.split(" ")[0])
# k = int(inp1.split(" ")[1])
# q = int(inp1.split(" ")[2])

n,k,q = map(int, input().split())
each_point = []
for i in range(n):
  each_point.append(k-q)
 
for j in range(q):
  each_point[int(input())-1] += 1
 
for x in range(n):
  if (each_point[x] < 1):
    print("No")
  else:
    print("Yes")
Buggy code:
inp1 = input()
n = int(inp1.split(" ")[0])
k = int(inp1.split(" ")[1])
q = int(inp1.split(" ")[2])

each_point = []
for i in range(n):
  each_point.append(k)


for j in range(q):
  ans = int(input())
  for m in range(n):
    int_point[m] -= 1
  int_point[ans-1] += 1

for x in range(n):
  if (int_point[x] < 1):
    print("No")
  else:
    print("Yes")


Fixed code:
inp1 = input()
n = int(inp1.split(" ")[0])
k = int(inp1.split(" ")[1])
q = int(inp1.split(" ")[2])

each_point = []
for i in range(n):
  each_point.append(k-q)
 
for j in range(q):
  each_point[int(input())-1] += 1
 
for x in range(n):
  if (each_point[x] < 1):
    print("No")
  else:
    print("Yes")
Buggy code:
import sys

def happyo(n,each_point):
  for x in range(n):
    if (each_point[x] < 1):
      print("No")
    else:
      print("Yes")

inp1 = input()
n = int(inp1.split(" ")[0])
k = int(inp1.split(" ")[1])
q = int(inp1.split(" ")[2])

if(k>100000):
  for x in range(n):
    print("Yes")
  sys.exit()

each_point = []
for i in range(n):
  each_point.append(k-q)
 
print(each_point)
for j in range(q):
  ans = int(input())
  each_point[ans-1] += 1
 
happyo(n,each_point)

Fixed code:
import sys

def happyo(n,each_point):
  for x in range(n):
    if (each_point[x] < 1):
      print("No")
    else:
      print("Yes")

inp1 = input()
n = int(inp1.split(" ")[0])
k = int(inp1.split(" ")[1])
q = int(inp1.split(" ")[2])

if(k>100000):
  for x in range(n):
    print("Yes")
  sys.exit()

each_point = []
for i in range(n):
  each_point.append(k-q)
 

for j in range(q):
  ans = int(input())
  each_point[ans-1] += 1
 
happyo(n,each_point)
Buggy code:
n=[int(i) for i in input().split()]
array=[]
for i in range(n[0]):
  array.append(n[1])
for i in range(n[2]):
  array[int(input())-1]+=1
for i in range(n[2]):
  for i in range(n[0]):
    array[i]-=n[2]
	if(array[i]<=0):
      print("No")
    else:
      print("Yes")

Fixed code:
n=[int(i) for i in input().split()]
array=[]
for i in range(n[0]):
  array.append(n[1])
for i in range(n[2]):
  array[int(input())-1]+=1
for i in range(n[0]):
  array[i]-=n[2]
  if(array[i]<=0):
    print("No")
  else:
    print("Yes")
Buggy code:
n, k, q = map(int, input().split())
a_list = [int(input())-1 for _ in range(q)]
p_list = [k for _ in range(n)]

for a in a_list:
    for i in range(n):
        p_list[i] -= 1
    p_list[a] += 1

print(p_list)

for p in p_list:
    if p <= 0:
        print("No")
    else:
        print("Yes")


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

for a in a_list:
    p_list[a] += 1

for p in p_list:
    if p <= 0:
        print("No")
    else:
        print("Yes")
Buggy code:
n,k,q = map(int,input().split())
A = []
for i range in(q):
  a = int(input())
  A.append(a)
point = [k - q]*n

for i range(q):
  tmp = A[i] - 1
  point[tmp] += 1

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


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

for i in range(q):
  tmp = A[i] - 1
  point[tmp] += 1

for i in range(n):
    if point[i] > 0:
        print("Yes")
    else:
        print("No")
Buggy code:
data = input()
l = data.split()
l = list(map(int, l))

points = [0 for i in range(l[0])]

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

for p in points:
    if p < l[1] - 1:
        print("No")
    else:
        print("Yes")



Fixed code:
data = input()
l = data.split()
l = list(map(int, l))
p = l[1] - l[2]

points = [p for i in range(l[0])]

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

for p in points:
    if p <= 0:
        print("No")
    else:
        print("Yes")
Buggy code:
N, point, Q = map(int, input().split())
ans = [int(input()) for i in range(Q)]
ans = [n-1 for n in ans]
# participants = [i for i in range(N)]
points = [point for i in range(N)]

points = [n-len(ans) for n in points]

for i in ans:
    points[i] += 1

print(N, point, Q, ans, points)

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


Fixed code:
N, point, Q = map(int, input().split())
ans = [int(input()) for i in range(Q)]
ans = [n-1 for n in ans]
# participants = [i for i in range(N)]
points = [point for i in range(N)]

points = [n-len(ans) for n in points]

for i in ans:
    points[i] += 1

#print(N, point, Q, ans, points)

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


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

min_c = Q - K + 1

num = [0]*N

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

for j in num:
    if num[j] >= min_c:
        print('Yes')
    else:
        print('No')


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

min_c = Q - K + 1

num = [0]*N

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

for j in num:
    if j >= min_c:
        print('Yes')
    else:
        print('No')
Buggy code:
n = input().split()
p = []

for i in range(int(n[0])):
  p.append(int(n[1]))
  
for i in range(int(n[2])):
  a = input()
  a = int(a)
  p[a-1] += 1

for i in p:
  i -= int(n[1])
  if 0 < i:
    print("yes")
  else:
    print("No")

Fixed code:
n = input().split()
p = []

for i in range(int(n[0])):
    p.append(int(n[1]))

for i in range(int(n[2])):
    a = input()
    a = int(a)
    p[a - 1] += 1

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

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

Fixed code:
N,K,Q = map(int,input().split())
a = [0 for i in range(N)]
for i in range(Q):
  a[int(input())-1]+=1
for i in a:
  if K-Q+i>0:
    print("Yes")
  else:
    print("No")
Buggy code:
num, poi, ans = [int(x) for x in input().split()]

list01 = [poi for x in range(num)]
list02 = [0 for x in range(num)]

for i in range(ans):
  j = int(input())
  list02[j-1] += 1

for i in range(num):
  list02[i] = list02[i] + list01[i] - poi

for k in list02:
  if k <= 0:
    print("No")
  else:
    print("Yes")

Fixed code:
num, poi, ans = [int(x) for x in input().split()]

list01 = [poi for x in range(num)]
list02 = [0 for x in range(num)]

for i in range(ans):
  j = int(input())
  list02[j-1] += 1

for i in range(num):
  list02[i] = list02[i] + list01[i] - ans

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

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

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

lista = []
for i in range(n):
    lista.append(k-q)
print(lista)
for i in range(q):
    num = int(input())-1
    lista[num] = lista[num] +1
    #print(lista)
print(lista)
for i in range(n):
    if lista[i] > 0:
        print('Yes')
    else:
        print('No')


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

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

la = list()
for i in range(Q):
    la.append(int(input()))

lcount = [0] * N
for i in range(Q):
    lcount[la[i]-1] += 1
print(lcount)
for i in range(N):
    if K+lcount[i]-Q > 0:
        print("Yes")
    else:
        print("No")


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

la = list()
for i in range(Q):
    la.append(int(input()))

lcount = [0] * N
for i in range(Q):
    lcount[la[i]-1] += 1

for i in range(N):
    if K+lcount[i]-Q > 0:
        print("Yes")
    else:
        print("No")
Buggy code:
# -*- coding: utf-8 -*-

def main():
    n, k, q = map(int, input().split())
    a_list = []

    for i in range(q):
        a_list.append(int(input()))

    participant_list = [k-q] * n


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

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

if __name__ == "__main__":
    main()


Fixed code:
# -*- coding: utf-8 -*-

def main():
    n, k, q = map(int, input().split())
    a_list = []

    for i in range(q):
        a_list.append(int(input()))

    participant_list = [k-q] * n


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

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

if __name__ == "__main__":
    main()
Buggy code:
n,k,q = map(int, list(input().split()))
point=[k]*n
a=[]

for i in range(n):
	point[i]-=1
for i in range(q):
	a.append(int(input()))
	point[a[i]-1]+=1
max=max(point)
for i in range(n):
    if point[i]==max or point[i]>0:
        print("Yes")
    else:
        print("No")

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

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

n = [m[1]] * m[2]
print(n)

for i in range(m[2]):
    n = [i-1 for i in n]
    n[a[i]-1] +=1

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

Fixed code:
m = list(map(int,input().split()))
n = [0] * m[0]

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

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

print(*map(lambda x:['No','Yes'][x>0],score),sep='\n')

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

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

for i in map(lambda x:['No','Yes'][x>0],score):
    print(i)
Buggy code:
N, K, Q =map(int, input().split())
A = [int(input()) for _ in range(Q)]
point = [K-Q]*N

for i in range(Q):
  point[A[i]-1] += 1
  
for i in range(N):
  print('Yes' if result[i]>0 else 'No')

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


Fixed code:
n,k,q=map(int,input().split())
a=[int(input()) for _ in range(q)]
point=[0 for _ in range(n)]
for i in range(q):
  point[a[i]-1]+=1
for x in point:
  print('Yes' if x-q+k>0 else 'No')
Buggy code:
# coding: utf-8
import numpy as np

N, point, q = [int(x) for x in input().split()]
r_list = [q] * N
p_list = [point] * N
reduce_list = np.array(r_list)
points_list = np.array(p_list)

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

points_list = points_list - reduce_list

for p in points_list:
    if p <= 0:
        print('N0')
    else:
        print('Yes')

Fixed code:
# coding: utf-8
import numpy as np

N, point, q = [int(x) for x in input().split()]
r_list = [q] * N
p_list = [point] * N
reduce_list = np.array(r_list)
points_list = np.array(p_list)

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

points_list = points_list - reduce_list

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

mem = [k - len(a)] * n
for i in range(len(a)):
    mem[a[i]] += 1

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


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

mem = [k - len(a)] * n
for i in range(len(a)):
    mem[a[i]-1] += 1

for i in range(n):
    if mem[i] > 0:
        print('Yes')
    else:
        print('No')
Buggy code:
N,K,Q=map(int,input().split())
point=[K]*n
for i in range(Q):
  A=int(input())
  A=A-1
  point[A]+=1
for j in range(N):
  if point[j]>Q:
    print("Yes")
  else:
    print("No")

Fixed code:
N,K,Q=map(int,input().split())
point=[K]*N
for i in range(Q):
  A=int(input())
  A=A-1
  point[A]+=1
for j in range(N):
  if point[j]>Q:
    print("Yes")
  else:
    print("No")
Buggy code:
import numpy as np
N,K,Q=map(int,input().split())
A=[]
for i in range(Q):
    a=int(input())
    A.append(a)
    

P=[K]*N
P1=np.array(P)
for i in A:
    P1=P1-1
    P1[i-1]=P1[i-1]+1
    print(P1)
for i in range(len(P1)):
    if P1[i]>0:
        print('Yes')
    else:
        print('No')

Fixed code:
import numpy as np
N,K,Q=map(int,input().split())
A=[0]*N
P=[K-Q]*N
for i in range(Q):
    a=int(input())
    A[a-1]=A[a-1]+1
A=np.array(A)
P=np.array(P)
for i in range(N):
    if A[i]+P[i]>0:
        print('Yes')
    else:
        print('No')
Buggy code:
N, K, Q = map(int, input().split())
aList = []


ptsList = [0] * N
handy = Q - K
for i in range(N):
    ptsList.append(0)
if K - Q > 0:
    for i in range(N):
        print("Yes")
else:
    for i in range(Q):
        ptsList[int(input())-1] += 1

    for i, e in enumerate(ptsList):
        if e > handy:
            print("Yes")
        else:
            print("No")


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

ptsList = [K-Q]*N

if K - Q > 0:
    for i in range(N):
        print("Yes")
else:
    for i in range(Q):
        ptsList[int(input())-1] += 1

    for i, e in enumerate(ptsList):
        if e > 0:
            print("Yes")
        else:
            print("No")
Buggy code:
n, k, q = map(int, input().split())
a = [0] * q

for i in range(q):
    a[i] = int(input())
a_copy = [0] * n

for i in a:
    a_copy[i-1] += 1
print(a)
print(a_copy)
for i in a_copy:
    if q - i < k:
        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())
a_copy = [0] * n

for i in a:
    a_copy[i-1] += 1

for i in a_copy:
    if q - i < k:
        print("Yes")
    else:
        print("No")
Buggy code:
# coding: utf-8

def reader(N):
    for n in range(N):
        yield input()

def main():
    N, K, Q = input().split()
    N, K, Q = int(N), int(K), int(Q)
    participants = [K-Q for _ in range(N)]
    for a in reader(Q):
        participants[int(a)-1] += 1
    
    print(participants)
    for p in participants:
        if p > 0:
            print('Yes')
        else:
            print('No')

main()


Fixed code:
# coding: utf-8

def reader(N):
    for n in range(N):
        yield input()

def main():
    N, K, Q = input().split()
    N, K, Q = int(N), int(K), int(Q)
    participants = [K-Q for _ in range(N)]
    for a in reader(Q):
        participants[int(a)-1] += 1
    
    for p in participants:
        if p > 0:
            print('Yes')
        else:
            print('No')

main()
Buggy code:
n, k, q = map(int, input().split())
li = [0 for _ in range(n)]

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

print(li)
for j in li:
    if k - q + j > 0:
        print("Yes")
    else:
        print("No") 

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

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

for j in li:
    if k - q + j > 0:
        print("Yes")
    else:
        print("No")
Buggy code:
n,k,q=map(int,input().split())

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

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

for i in range(n):
    print('Yes' if scores[i]+n>=k else 'No')


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

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

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

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

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

l = [k for i in range(n)]

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

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

for i in range(n):
  l[i] = l[i] - (q - m[i])
  
  if l[i] > 0:
    print("Yes")
  
  else:

Fixed code:
sn,sk,sq = input().split(" ")
n = int(sn)
k = int(sk)
q = int(sq)

l = [k for i in range(n)]

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

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

for i in range(n):
  l[i] = l[i] - (q - m[i])
  
  if l[i] > 0:
    print("Yes")
  
  else:
     print("No")
Buggy code:
#C
n, k, q = map(int, input().split())
a = [int(input()) for _ in range(q)]
people = [0] * n
for i in a:
    people[i-1] += 1
print(people)
for i in people:
    if k <= q - i:
        print("No")
    else:
        print("Yes")

Fixed code:
#C
n, k, q = map(int, input().split())
a = [int(input()) for _ in range(q)]
people = [0] * n
for i in a:
    people[i-1] += 1
# print(people)
for i in people:
    if k <= q - i:
        print("No")
    else:
        print("Yes")
Buggy code:
n,k,q=map(int,input().split())
a=[0]*n
for i in range(q):
    x=int(input())
    a[x-1]+=1;
print(a)
for i in range(n):
    if(k+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):
    x=int(input())
    a[x-1]+=1;
for i in range(n):
    if(k+a[i]-q>0):
        print("Yes")
    else:
        print("No")
Buggy code:
n, k, q = map(int, input().split())

scores = [k] * n

for index in range(q):
    winner = int(input())
    for participant in range(n):
        if not participant == winner:
            scores[participant] -= 1

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


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

scores = [k - q] * n

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

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