Buggy python submission (verdict: Runtime Error):
from collections import deque
n,k,q = map(int, input().split())
start = [k-q]*n
points = deque(start)
for i in range(q):
    point = int(input())
    points[i-1] += 1
for _ in range(len(points)):
  x = points.popleft()
  if x <= 0:
    print('No')
  else:
    print('Yes')

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

Buggy python submission (verdict: Time Limit Exceeded):
from collections import deque
n,k,q = map(int, input().split())
a = [int(input()) for _ in range(q)]
start = [k-q]*n
points = deque(start)
for i in set(a):
    points[i-1] += a.count(i)
for _ in range(len(points)):
  x = points.popleft()
  if x <= 0:
    print('No')
  else:
    print('Yes')

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

Buggy python submission (verdict: Runtime Error):
n,k,q=map(int,input().split())
a=[k-q]*n
for i in range(q):
    point=int(input())
    a[point-1] += 1
for i in range(len(l)):
    if l[i] > 0:
        print("Yes")
    else:
        print("No")

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

Buggy python submission (verdict: Runtime Error):
n,k,q=map(int,input().split())
a=[k-q]*n
for i in range(q):
    point=int(input())
    a[point-1] += 1
for i in range(len(l)):
    if l[i] > 0:
        print("Yes")
    else:
        print("No")

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

Buggy python submission (verdict: Runtime Error):
n,k,q = map(int, input().split())
a = [k-q]*n
for i in range(q):
  a[int(input())-1] += 1
for i in points:
  if i <= 0:
    print('No')
  else:
    print('Yes')

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

Buggy python submission (verdict: Runtime Error):
n,k,q = map(int, input().split())
a = [k-q]*n
for i in int(input()):
  a[i-1] += 1
for i in points:
  if i <= 0:
    print('No')
  else:
    print('Yes')

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

Buggy python submission (verdict: Time Limit Exceeded):
from sys import stdin
n,k,q = map(int, stdin.readline().split())
a = [int(stdin.readline()) for _ in range(q)]
points = list(map(lambda x: x-q, [k for i in range(n)]))
for i in set(a):
    points[i-1] += a.count(i)
for i in points:
  if i <= 0:
    print('No')
  else:
    print('Yes')

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

Buggy python submission (verdict: Time Limit Exceeded):
n,k,q = map(int, input().split())
a = [int(input()) for _ in range(q)]
points = list(map(lambda x: x-q, [k for i in range(n)]))
for i in set(a):
    points[i-1] += a.count(i)
for i in points:
  if i <= 0:
    print('No')
  else:
    print('Yes')

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