Buggy python submission (verdict: Time Limit Exceeded):
N, K, Q = map(int, input().split())
point = [0] * N

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

for i in range(len(point)):
    ans = K - (sum(point) - point[i])
    if ans > 0:
        print("Yes")
    else:
        print("No")

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

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

sum_point = sum(point)

for i in range(N):
    ans = K - (sum_point - point[i])
    if ans > 0:
        print("Yes")
    else:
        print("No")

Buggy python submission (verdict: Time Limit Exceeded):
N, K, Q = map(int, input().split())
A = []
point = [0] * N

for i in range(Q):
  A.append(int(input()))
  i += 1

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

for i in range(len(point)):
    ans = K - (sum(point) - point[i])
    if ans > 0:
        print("Yes")
    else:
        print("No")

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

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

sum_point = sum(point)

for i in range(N):
    ans = K - (sum_point - point[i])
    if ans > 0:
        print("Yes")
    else:
        print("No")

Buggy python submission (verdict: Time Limit Exceeded):
N, K, Q = map(int, input().split())
A = []
point = [0] * N

for i in range(Q):
  A.append(int(input()))
  i += 1

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

point2 = []
for i in range(len(point)):
    point2.append(K - (sum(point) - point[i]))

for i in point2:
  if i > 0:
    print("Yes")
  else:
    print("No")

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

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

sum_point = sum(point)

for i in range(N):
    ans = K - (sum_point - point[i])
    if ans > 0:
        print("Yes")
    else:
        print("No")

Buggy python submission (verdict: Time Limit Exceeded):
N, K, Q = map(int, input().split())
#print(N, K, Q)

A = []
point = [K]*N
#print(point)

for i in range(Q):
  A.append(int(input()))
  i += 1
#print(A)

for i in A:
  for j in range(N):
    if point[j] > 0 and j != (i - 1):
      point[j] -= 1
    else:
      continue

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

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

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

sum_point = sum(point)

for i in range(N):
    ans = K - (sum_point - point[i])
    if ans > 0:
        print("Yes")
    else:
        print("No")

Buggy python submission (verdict: Time Limit Exceeded):
N, K, Q = map(int, input().split())
#print(N, K, Q)

A = []
point = []

for i in range(N):
  point.append(K)
  i += 1
#print(point)

for i in range(Q):
  A.append(int(input()))
  i += 1
#print(A)

for i in A:
  for j in range(N):
    if j != (i - 1):
      point[j] -= 1
    else:
      continue

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

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

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

sum_point = sum(point)

for i in range(N):
    ans = K - (sum_point - point[i])
    if ans > 0:
        print("Yes")
    else:
        print("No")