qyliang/CodeNanoFix huggingface dataset:
Buggy code:
A = list(map(int, input().split())) 
N = A[0]
K = A[1]
Q = A[2]
n = [K for _ in range(N)]
for i in range(N):
    N[i] -= Q
for _ in range(Q):
    ans = int(input()) - 1
    N[ans] += 1
for i in range(N):
    if(n[i] > 0):
        print("Yes")
    else:
        print("No")


Fixed code:
A = list(map(int, input().split())) 
N = A[0]
K = A[1]
Q = A[2]
n = [K for _ in range(N)]
for i in range(N):
    n[i] -= Q
for _ in range(Q):
    ans = int(input()) - 1
    n[ans] += 1
for i in range(N):
    if(n[i] > 0):
        print("Yes")
    else:
        print("No")
Buggy code:
import sys

n,k,q=map(int,input().split())
a=[int(input()) for i in range(q)]

if k>q:
    for i in range(n):
        print('Yes')
    sys.exit()

d=[0]*n

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

print(d)

for j in d:
    if j>q-k:
        print('Yes')
    else:
        print('No')

Fixed code:
import sys

n,k,q=map(int,input().split())
a=[int(input()) for i in range(q)]

if k>q:
    for i in range(n):
        print('Yes')
    sys.exit()

d=[0]*n

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

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

m=[0]*n

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

for j in range(n):
  m[j]=k+m[j]-q

cnt=0
for h in range(n):
  if m[h]>0:
    cnt+=h

ans=['No']*n

ans[cnt]='Yes'

print('\n'.join(ans))

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

m=[0]*n

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

for j in range(n):
  m[j]=k+m[j]-q

ans=['No']*n

for h in range(n):
  if m[h]>0:
    ans[h]='Yes'

print('\n'.join(ans))
Buggy code:
import numpy as np
N, K, Q  = map(int, input().split())
score = np.zeros(N)
for i in range(Q):
  num = int(input())
  score[num] += 1

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

Fixed code:
import numpy as np
N, K, Q  = map(int, input().split())
score = np.zeros(N)
for i in range(Q):
  num = int(input())
  score[num-1] += 1

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

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

ans=np.zeros(n)

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

for i in range(n):
    if k+ans[i]>q:
        print("yes")
    else:
        print("No")


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

ans=np.zeros(n)

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

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






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


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

point_list = [K-Q]*N

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

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

point_list = [K-Q]*N

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

change = np.array([0]*N)
cnt = 1

ans_num_list = [int(input()) for _ in range(Q)]
#print(ans_num_list)

for i in ans_num_list:
  change[i] += 1
  change = change - 1

output = point_list + change
# print(output)

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

Fixed code:
import numpy as np
N, K, Q = map(int, input().split(" "))
point_list = np.array([K-Q]*N)
ans_num_list = [int(input()) for _ in range(Q)]

num_answer_correct = np.array([0]*N)
for i in ans_num_list:
  num_answer_correct[i-1] += 1

point_list = point_list + num_answer_correct
# print(output)

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

import numpy as np

Nwin = np.zeros(N)

#print(Nwin)

A = []

for q in range(Q):
  a = int(input())
  #A.append(a)
  Nwin[a-1] += 1

print(Nwin)

for n in range(N):
  if (K-Q+Nwin[n]>0):
    #print(n)
    print('Yes')
  else:
    ##print(n)
    print('No')

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

import numpy as np

Nwin = np.zeros(N)

#print(Nwin)

A = []

for q in range(Q):
  a = int(input())
  #A.append(a)
  Nwin[a-1] += 1

#print(Nwin)

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

res = [0]*n

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

print(res)
for i in res:
    if i <= q - k:
        print("No")
    else:
        print("Yes")


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

res = [0]*n

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

for i in res:
    if i <= q - k:
        print("No")
    else:
        print("Yes")
Buggy code:
N,K,Q =map(int,input().split())
M = [K-Q]*N

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

for m in M:
  if m<=0:
    print("No")
  else:
    print("Yes")

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

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

for m in M:
  if m<=0:
    print("No")
  else:
    print("Yes")
Buggy code:
N,K,Q = map(int,input().split())
A = [int(input()) for _ in range(Q)]

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

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

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


def winner_or_loss(point):
    return 'Yes' if point > 0 else 'No'


def solve():
    point = [K-Q] * N

    for answer_id in A:
        answer_id -= 1
        point[answer_id] += 1

    return '\n'.join(list(map(winner_or_loss, point)))


print(solve())


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


def winner_or_loss(point):
    return 'Yes' if point > 0 else 'No'


def solve():
    point = [K-Q] * N

    for answer_id in A:
        answer_id -= 1
        point[answer_id] += 1

    return '\n'.join(list(map(winner_or_loss, point)))


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


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

input = sys.stdin.readline

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

if __name__ == '__main__':
    main()

Fixed code:
import sys

input = sys.stdin.readline

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

if __name__ == '__main__':
    main()
Buggy code:
N, K, Q = map(int, input().split())
N_list = [0] * N

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

for i in N_list:
  if N_list[i] - Q + K > 0:
    print('Yes')
  else:
    print('No')


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

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

for n in N_list:
  if n + K - Q > 0:
    print('Yes')
  else:
    print('No')
Buggy code:
N,K,Q = map(int,input().split(' '))
A_i = list()
for k in range(Q):
    k = int(input())
    A_i.append(k)

First = [K-Q] * N

for i in A_i:
    First[i] += 1
for j in First:
    if j <= 0:
        print('No')
    else:
        print('Yes') 

Fixed code:
N,K,Q = map(int,input().split(' '))
A_i = list()
for k in range(Q):
    k = int(input())
    A_i.append(k)

First = [K-Q] * N

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


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


ans = ["No"] * n
for key,val in Counter(a).items():
    if val + k - q > 0:
        ans[key-1] = "Yes"

[print(i) for i in ans];

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

if k > q: ans = ["Yes"] * n
else: ans = ["No"] * n

for key,val in Counter(a).items():
    if val + k - q > 0:
        ans[key-1] = "Yes"

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

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

for i in range(q):
    x = int(input())
    p_lis[x-1] += 1
for j in p_lis:
    if j > 0:
        print("Yes")
    else:
        print("No")
Buggy code:
n, k, q = map(int, input().split())
ad = [0]*n
print(ad)
for _ in range(q):
    ai = int(input())
    ad[ai-1] += 1
for adi in ad:
    if k + adi - q <= 0:
        print('No')
    else:
        print('Yes')

Fixed code:
n, k, q = map(int, input().split())
ad = [0]*n
for _ in range(q):
    ai = int(input())
    ad[ai-1] += 1
for adi in ad:
    if k + adi - q <= 0:
        print('No')
    else:
        print('Yes')
Buggy code:
import numpy as np

nkq = np.array(list(map(int, input().split())))

p = np.array([0 for i in range(nkq[0])])

#print(p)
a = np.array([int(input()) for i in range(nkq[2])])
for i in range(nkq[2]):
    p[a[i]-1] += 1
    #print(p)

p = [print('Yes') if p[i]-max(p) >= 0 else print('No') for i in range(len(p))]

Fixed code:
import numpy as np

nkq = np.array(list(map(int, input().split())))

p = np.array([nkq[1]-nkq[2] for i in range(nkq[0])])

#print(p)
a = np.array([int(input()) for i in range(nkq[2])])
for i in range(nkq[2]):
    p[a[i]-1] += 1
    #print(p)

a = [print('Yes') if p[i] > 0 else print('No') for i in range(len(p))]
Buggy code:
import collections

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

c=collections.Counter(a)
print(c)

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


Fixed code:
import collections

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

c=collections.Counter(a)

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

n_points = [0 for _ in range(n)]

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

print(n_points)
for n_point in n_points:
    if n_point + k > q:
        print('Yes')
    else:
        print('No')


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

n_points = [0 for _ in range(n)]

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

for n_point in n_points:
    if n_point + k > q:
        print('Yes')
    else:
        print('No')
Buggy code:
N, K, Q = [int(e) for e in input().split()]
A = [0] * N

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

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

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

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

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

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

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

count = np.zeros(N)

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

ans = K - (Q - count)

print(ans)

for answer in ans:
    if answer <= 0:
        print('No')
    else:
        print('Yes')
    


Fixed code:
import numpy as np

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

count = np.zeros(N)

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

ans = K - (Q - count)

for answer in ans:
    if answer <= 0:
        print('No')
    else:
        print('Yes')
Buggy code:
def acinput():
    return list(map(int, input().split(" ")))


N,K,Q=acinput()
a=[]
for i in range(Q):
    a.append(int(input()))

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

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

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



Fixed code:
def acinput():
    return list(map(int, input().split(" ")))


N,K,Q=acinput()
a=[]
for i in range(Q):
    a.append(int(input()))

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

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

for i in range(N):
    if score[i]<=0:
        print("No")
    else:
        print("Yes")
Buggy code:
N, K, Q = (int(i) for i in input().split())
A = [None] * (Q)
for i in range(Q):
    A[i] = int(input())
    
right_cnt = [0] * (N+1)
for a in A:
    right_cnt[a] += 1
 
print(right_cnt)   
for i in range(1, N+1):
    if Q - right_cnt[i] < K:
        print('Yes')
    else:
        print('No')
    

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

Fixed code:
n,k,q = map(int, input().split())
b = []
for i in range(n):
    b.append(0)
for i in range(q):
    a = int(input())
    b[a-1] += 1
for i in range(n):
    if b[i] > q - k:
        print('Yes')
    else:
        print('No')
Buggy code:
#ABC 141 C  Attack Survival
N,K,Q= map(int,input().split())
A=[K-Q]*N
for i in range(1,Q+1):
    A[int(input())]+=1
for a in A:
    if a < 1:
        print('No')
    else:
        print('Yes')

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

Fixed code:
n,k,q = map(int,input().split())
l= [int(input()) for i in range(q)]
x=[k-q]*n
for i in range(q):
  x[l[i]-1]+=1
for i in range(n):
  if x[i]>0: 
    print("Yes")
  else:
    print("No")
Buggy code:
import numpy as np
N, K, Q = map(int, input().split())
S = []
for _ in range(H):
    S.append(int(input())) 
P=np.array([K]*N)
for i in range(Q):
  a=[-1]*N
  a[S[i]]=0
  P +=a
for i in range(N):
  if P[i] <= 0:
    print("No")
  else:
    print("Yes")

Fixed code:
import numpy as np
N, K, Q = map(int, input().split())
S = []
for _ in range(Q):
    S.append(int(input())) 
P=[K]*N
for i in range(Q):
  P[S[i]-1]+=1
P = np.array(P)
P -= Q
for i in range(N):
  if P[i] <= 0:
    print("No")
  else:
    print("Yes")
Buggy code:
import sys


def main():
    n, k, q = [int(s) for s in sys.stdin.readline().strip().split()]
    a = [0] * q
    for i in range(q):
        a[i] = int(sys.stdin.readline().strip()) - 1

    scores = [0] * n
    for ai in a:
        scores[ai] += 1

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


main()


Fixed code:
import sys


def main():
    n, k, q = [int(s) for s in sys.stdin.readline().strip().split()]
    a = [0] * q
    for i in range(q):
        a[i] = int(sys.stdin.readline().strip()) - 1

    scores = [0] * n
    for ai in a:
        scores[ai] += 1

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


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

ans=0

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

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

ans=0

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

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

dic = {}

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

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

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

dic = {}

for i in range(N):
    dic[i+1] = 0

for i in range(Q):
  if A[i] in dic:
    dic[A[i]] += 1
  else:
    dic[A[i]] = 1
    
    
for i in range(N):
  if K - (Q - dic[i+1]) <= 0:
    print('No')
    
  else:
    print('Yes')
Buggy code:
import numpy as np

N, K, Q = map(int,input().split())
A = []
for i in range(0, Q):
    A.append(int(input()))
a = np.array([K] * N)
for i in A:
    a[i-1] += 1
    a = a - 1
print(a)

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


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

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

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

score = [k]*n

for i in a:
    score[i-1] += 1
    for x in range(len(score)):
         score[x] = score[x] - 1
    print(score)

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


Fixed code:
n, k, q = map(int, input().split())
a = list()
for i in range(0, q):
    a.append(int(input()))

score = [k - q]*n

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

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

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

count = []
for i in range(N):
    count.append(K)

for i in range(Q):
    for j in range(N):
        if j != a[i]:
            count[j] = count[j] - 1
for i in range(N):
    if count[i] <= 0:
        print('No')
    else:
        print('Yes')

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

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

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

print(Point)
for n in range(N):
    if Point[n] - Q > 0:
        print('Yes')
    else:
        print('No')


Fixed code:
N, K ,Q = list(map(int, input().split()))
Point = [K for n in range(N)]
for q in range(Q):
    A = int(input()) - 1
    Point[A] += 1

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

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
for j in range(N):
  if B[j] <= Q - K:
    print('No')
  else:
    print('Yes')
Buggy code:
N, K, Q = map(int, input().split())
A = np.array([int(input()) for _ in range(Q)])

ans = np.zeros(N)
ans += K

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

ans -= Q

for a in ans:
    if a>0:
        print("Yes")
    else:
        print("No")

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

ans = np.zeros(N)
ans += K

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

ans -= Q

for a in ans:
    if a>0:
        print("Yes")
    else:
        print("No")