Buggy python submission (verdict: Time Limit Exceeded):
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)]

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

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

Fixed submission:
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 python submission (verdict: Time Limit Exceeded):
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)]

for i in range(len(ans)):
    points = [n-1 for n in points]

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

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


Fixed submission:
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 python submission (verdict: Time Limit Exceeded):
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)]

for i in range(len(ans)):
    points = [n-1 for n in points]

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

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


Fixed submission:
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 python submission (verdict: Time Limit Exceeded):
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)]

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

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


Fixed submission:
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')