qyliang/CodeNanoFix huggingface dataset:
Buggy code:
eople,point,quiz = map(int,input().split())
an = [int(input()) for _ in range(quiz)]
each_p = [point-quiz] * people

for x in an:
    each_p[x-1] += 1

for y in each_p:
    if y <= 0:
        print("No")
    else:
        print("Yes")


Fixed code:
people,point,quiz = map(int,input().split())
an = [int(input()) for _ in range(quiz)]
each_p = [point-quiz] * people

for x in an:
    each_p[x-1] += 1

for y in each_p:
    if y <= 0:
        print("No")
    else:
        print("Yes")
Buggy code:
n, k, q = map(int, input().split())
a = []
for i in range(q):
    a[i] = int(input()) - 1
score = [0 for _ in range(n)]

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

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


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

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

for i in range(n):
    result = k - q + score[i]
    print("Yes" if result > 0 else "No")
Buggy code:
N,K,Q=map(int, input().split())
 
list=[(K-Q) for j in range(N)]
 
for i in range(Q):
	A=int(input())-1
  	list[A]+=1
 
for score in list:
  	if score>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 j in range(N):
    if K-Q+A[j]>0:
        print('Yes')
    else:
        print('No')
Buggy code:
N,K,Q=map(int,input().split())

list=[(K-Q) for i in range(N)]

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

for score in list:
  	if score>0:
      	print("Yes")
	else:
      	print("No")

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

b = ["No"]*n
    

for i in range(n):
    if k - q + a[i] > 0 :
        b[i] = "Yes"

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

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

b = ["No"]*n
    

for i in range(n):
    if k - q + a[i] > 0 :
        b[i] = "Yes"

for i in range(n):
    print(b[i])
Buggy code:
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]

points = [K - Q] * N

for i in A:
    points[i - 1] += 1
for p in points:
    if p > 0:
        print("yes")
    else:
        print("No")

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

points = [K - Q] * N

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

for e in a:
    res[e]-=1

for e in res:
    print('Yes' if e<0 else 'NO')

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

for e in a:
    res[e]-=1

for e in res:
    print('Yes' if e<0 else 'No')
Buggy code:
n,k,q = map(int,input().split(" "))
point = [k for i in range(n)]
ans = [0 for i in range(q)]

for i in range(q):
    ans[i] = int(input())
    point=list(map(lambda x:x-1,point))
    point[ans[i]-1] += 1
    
print(point)
for i in range(n):
    if(point[i] <= 0):
        print("No")
    else:
        print("Yes")

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

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

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

for i in range(Q):
    if Q - A[i] > K:
        print("Yes")
    else:
        print("No")

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

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


for j in range(N):
    if scores[j] + K - Q > 0:
        print("Yes")
    else:
        print("No")
Buggy code:
# -*- coding: utf-8 -*-
"""
Created on Wed Sep  9 15:18:03 2020

@author: liang
"""
N, K, Q = map(int, input().split())
A = [0]*N
for i in range(Q):
    t = int(input())
    A[t-1] += 1

for i in range(Q):
    if Q - A[i] > K:
        print("Yes")
    else:
        print("No")

Fixed code:
# -*- coding: utf-8 -*-
"""
Created on Wed Sep  9 15:18:03 2020

@author: liang
"""
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 range(N):
   # print(Q-A[i])
    if Q - A[i] <  K:
        print("Yes")
    else:
        print("No")
Buggy code:
from collections import defaultdict


N, K, Q = list(map(int, input().split()))
a = [int(input()) for _ in range(N)]

num_ans = defaultdict(int)
for i in a:
    num_ans[i-1] += 1

for i in range(N):
    win = K - (Q - num_ans[i]) > 0
    print('Yes' if win else 'No')



Fixed code:
from collections import defaultdict

N, K, Q = map(int, input().split(' '))
a = [int(input()) for _ in range(Q)]

num_ans = defaultdict(int)
for i in a:
    num_ans[i-1] += 1

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


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

tokuten=[0]*n

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

for i in range(n):
    if tokuten[i]>=q-k+1
        print("Yes")
    else:
        print("No")

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

tokuten=[0]*n

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

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

  

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

for a in A:
    print('Yes' if (K - Q + A) > 0 else 'No')

Fixed code:
N,K,Q=map(int,input().split())
A=[int(input()) for i in range(Q)]
S=[0]*N
for a in A:
    S[a-1]+=1
for s in S:
    print('Yes' if K-Q+s>0 else 'No')
Buggy code:
inp = list(map(int,input().split()))
question = [int(input()) for i in range(inp[2])]
point = []
sinshutu = []
for i in range(inp[0]):
    point.append(inp[1])
    sinshutu.append('No')

for i in range(inp[2]):
    point[question[i]-1] = point[question[i]-1]+1

point = list(map(lambda x:x-4, point))

for i in range(len(point)):
    if point[i] > 0:
        sinshutu[i] = 'Yes'

print(sinshutu)

Fixed code:
inp = list(map(int,input().split()))
question = [int(input()) for i in range(inp[2])]
point = []
sinshutu = []
for i in range(inp[0]):
    point.append(inp[1])
    sinshutu.append('No')

for i in range(inp[2]):
    point[question[i]-1] = point[question[i]-1]+1

point = list(map(lambda x:x-inp[2], point))

for i in range(inp[0]):
    if point[i] > 0:
        sinshutu[i] = 'Yes'
    print(sinshutu[i])
Buggy code:
n,k,q=map(int,input().split()) 
print(score)

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

for j in range(n):
    if score[j-1] > 0:
        print('Yes')
    else:
        print('No')
        
        

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


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

for j in range(n):
    if score[j] > 0:
        print('Yes')
    else:
        print('No')
Buggy code:
n, k, q = list(map(int, input().split()))
answer = [0 for i in range(n)]

for i in range(q):
  answer[int(input())] += 1
  
for i in range(n):
  if q - answer[i] < k:
    print('Yes')
  else:
    print('No')

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

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

S=[0]*n
for i in range(q):
    a = int(input())
    S[a-1]+=1
    
print( S, max(S) )

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


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

S=[0]*n
for i in range(q):
    a = int(input())
    S[a-1]+=1
    
for i in range(n):
    if S[i]>q-k :
        print("Yes")
    else:
        print("No")
Buggy code:
import math
import sys
from collections import deque
import heapq
import copy
import itertools
from itertools import permutations
from itertools import combinations
import bisect
def mi() : return map(int,sys.stdin.readline().split())
def ii() : return int(sys.stdin.readline().rstrip())
def i() : return sys.stdin.readline().rstrip()
a,b,c=mi()
l=[0]*a
for i in range(c):
  j=ii()
  l[i-1]+=1
for k in l:
  if b+k-c>0:
    print("Yes")
  else:
    print("No")

Fixed code:
import math
import sys
from collections import deque
import heapq
import copy
import itertools
from itertools import permutations
from itertools import combinations
import bisect
def mi() : return map(int,sys.stdin.readline().split())
def ii() : return int(sys.stdin.readline().rstrip())
def i() : return sys.stdin.readline().rstrip()
a,b,c=mi()
l=[0]*a
for i in range(c):
  j=ii()
  l[j-1]+=1
for k in l:
  if b+k-c>0:
    print("Yes")
  else:
    print("No")
Buggy code:
import sys
import numpy as np
n,k,q=map(int,input().split())
list=[]
for i in range(q):
    list.append(int(input()))

point = [k] * n
print(point)
for i in range(len(list)):
    point[list[i]-1] += 1

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

Fixed code:
import sys
import numpy as np
n,k,q=map(int,input().split())
list=[]
for i in range(q):
    list.append(int(input()))

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

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

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

    def calc(n):
        return n-1

    for i in range(Q):
        P = list(map(calc,P))
        P[int(A[i])-1] += 1

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

Fixed code:
def resolve():
    N,K,Q = list(map(int,input().split()))
    A = [input() for i in range(Q)]
    P = [K] * N

    def calc(n):
        return n-Q

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

    P = list(map(calc, P))

    for i in range(N):
        if P[i] <= 0:
            print("No")
        else:
            print("Yes")
resolve()
Buggy code:
# INPUT
N, K, Q = map(int, input().split())
A = []
for i in range(Q):
    A.append(int(input()))
print(A)
# PROCESS
points = [0 for x in range(N+1)]
for x in A:
    points[x]+=1
print(points)
threshold = K - Q
# OUPUT
for y in range(1, N+1):
    if threshold + points[y] > 0:
        print("Yes")
    else:
        print("No") 






Fixed code:
# INPUT
N, K, Q = map(int, input().split())
A = []
for i in range(Q):
    A.append(int(input()))
# PROCESS
points = [0 for x in range(N+1)]
for x in A:
    points[x]+=1
threshold = K - Q
# OUPUT
for y in range(1, N+1):
    if threshold + points[y] > 0:
        print("Yes")
    else:
        print("No")
Buggy code:
n, k, q = map(int, input().split())
count = [int(input()) - 1 for _ in range(q)]
score = [0 for _ in range(n)]
for i in count:
    score[i] += 1
for i in score:
    if i >= k:
        print("No")
    else:
        print("Yes")

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

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

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

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

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

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

points = [K-Q] * (N+1)

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

for point in points:
    if (point > 0):
        print("Yes")
    else:
        print("No")

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

points = [K-Q] * N

for ans in A:
    points[ans - 1] += 1

for point in points:
    if (point > 0):
        print("Yes")
    else:
        print("No")
Buggy code:
# import collections

print('input >>')
N, K, Q = map(int, (input().split()))
points = [K] * N
A = []
for _ in range(Q):
    A.append(int(input()))

Acount = collections.Counter(A)

for answerer, times in Acount.items():
    points = [p - times for p in points]
    points[answerer - 1] += times

# print('----------output----------')

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

Fixed code:
import collections

# print('input >>')
N, K, Q = map(int, (input().split()))
points = [K] * N
A = []
for _ in range(Q):
    A.append(int(input()))

Acount = collections.Counter(A)

for answerer, times in Acount.items():
    points[answerer - 1] += times

# print('----------output----------')

for answerer in range(N):
    print('Yes') if points[answerer] > Q else print('No')
Buggy code:
def splitter(type,input):
    return list(map(lambda x:type(x),input.split()))

s1 = splitter(int,input())
N = s1[0]
K = s1[1]
Q = s1[2]

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



Fixed code:
def splitter(type,input):
    return list(map(lambda x:type(x),input.split()))

s1 = splitter(int,input())
N = s1[0]
K = s1[1]
Q = s1[2]

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

lis=[0]*n

for i in range(0,q):
  lis[int(input())]+=1
for p in lis:
  if k-q+p>0:
    print("Yes")
  else:
    print("No")

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

lis=[0]*n

for i in range(0,q):
  lis[int(input())-1]+=1
for p in lis:
  if k-q+p>0:
    print("Yes")
  else:
    print("No")
Buggy code:
import collections
n, k, q = map(int, input().split())
u = [int(input()) for jjj in range(q)]
c = collections.Counter(u)
m = {h: hh for h, hh in c.most_common()}
u = set(u)
for x in range(1, n+1):
    if x not in u:
        print('Yes')
        continue
    if n > m[x]:
        print('Yes')

Fixed code:
import collections
n, k, q = map(int, input().split())
u = [int(input()) for jjj in range(q)]
c = collections.Counter(u)
m = {h: hh for h, hh in c.most_common()}
u = set(u)
for x in range(1, n+1):
    if x not in u:
        if k - q > 0:
            print('Yes')
        else:
            print('No')
        continue
    if k - (q - m[x]) > 0:
        print('Yes')
    else:
        print('No')
Buggy code:
from sys import stdin


def main():
    N, K, Q = [int(x) for x in stdin.readline().rstrip().split()]
    As = [int(stdin.readline().rstrip()) for _ in range(Q)]
    score = [0] * N
    for A in As:
        score[A - 1] += 1
    for s in score:
        x = K - (Q - s)
        print('Yse' if 0 < x else 'No')


if __name__ == "__main__":
    main()


Fixed code:
from sys import stdin


def main():
    N, K, Q = [int(x) for x in stdin.readline().rstrip().split()]
    As = [int(stdin.readline().rstrip()) for _ in range(Q)]
    score = [0] * N
    for A in As:
        score[A - 1] += 1
    for s in score:
        x = K - (Q - s)
        print('Yes' if 0 < x else 'No')


if __name__ == "__main__":
    main()
Buggy code:
N,K,Q=map(int,input().split(" "))
A=[]
for _ in range(Q):
    A.append(int(input()))

ans=[K for _ in range(N)]
for q in A:
    ans[q-1]+=1
print(ans)
for a in ans:
    if a>Q:
        print("Yes")
    else:
        print("No")


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

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

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

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

b = [k - q] * n

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

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

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


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

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

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

for j in range(N):
    sanka[j]=sanka[j]+K-Q

print(sanka)

for k in range(N):
    if sanka[k]>=1:
        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 j in A:
    if K-Q+j > 0:
        print("Yes")
    else:
        print("No")
Buggy code:
n,k,q=map(int,input().split())
m=[0]*n
ans=0
for i in range(q):
    answer=int(input())
    m[answer-1]+=1
for _ in range(q):
    if k-q+m[_]>0:
        print("Yes")
    else:
        print("No")


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

if __name__ == "__main__":
    solve()
    

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

if __name__ == "__main__":
    solve()
Buggy code:
N, K, Q = map(int, input().split())
A = [int(input())-1 for _ in range(Q)]

def solve():
    points = [0 for _ in range(N)]
    for a in A:
        points[a] += 1
    sum_points = sum(points)
    print(points)
    print(sum_points)
    for p in points:
        if sum_points - p >= K:
            print('No')
        else:
            print('Yes')

if __name__ == '__main__':
    solve()

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

def solve():
    points = [0 for _ in range(N)]
    for a in A:
        points[a] += 1
    sum_points = sum(points)
    for p in points:
        if sum_points - p >= K:
            print('No')
        else:
            print('Yes')

if __name__ == '__main__':
    solve()
Buggy code:
N,K,Q = map(int,input().split())
S=[int(input()) for i in range(Q)]
Point=[int(K-Q) for i in range(N)]
for x in range(Q):
    Point[S[x]]+=1

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

Fixed code:
N,K,Q = map(int,input().split())
S=[int(input()) for i in range(Q)]
Point=[int(K-Q) for i in range(N)]
for x in range(Q):
    Point[S[x]-1]+=1

for x in range(N):
    if Point[x]<1:
        print("No")
    else:
        print("Yes")
Buggy code:
N,K,Q = input().split()
N=int(N)
K=int(K)
Q=int(Q)
 
seikai_list = [K - Q] * N
for i in range(Q):
  num = int(input()) -1
  seikai_list[num] = seikai_list[num] +1

for n in seikai_list:
  if n > 0:
    print("yes")
  else:
    print("No")


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

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

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

Fixed code:
#ABC141_C
N,K,Q=map(int,input().split())
ans=[K-Q]*N
for _ in range(Q):
    idx=int(input())
    ans[idx-1]+=1
for i in range(len(ans)):
    if ans[i]>0:
        print('Yes')
    else:
        print('No')
Buggy code:
#ABC141_C
N,K,Q=map(int,input().split())
ans=(K-Q)*np.ones((1,N),dtype='int32')
print(ans)
for _ in range(Q):
    idx=int(input())
    ans[0,idx-1]+=1
ans=ans.tolist()[0]
for i in range(len(ans)):
    if ans[i]>0:
        print('Yes')
    else:
        print('No') 

Fixed code:
#ABC141_C
import numpy as np
N,K,Q=map(int,input().split())
ans=(K-Q)*np.ones((1,N),dtype='int32')

for _ in range(Q):
    idx=int(input())
    ans[0,idx-1]+=1
ans=ans.tolist()[0]
for i in range(len(ans)):
    if ans[i]>0:
        print('Yes')
    else:
        print('No')