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

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

point=[0 for i in range(N)]

for i in range(Q):

  point[a[i]-1]=point[a[i]-1]+1

for j in range(N):

  if point[j]>=Q-K+1:

    print("Yes")

  else:

    print("No")
from collections import deque

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

ls=[int(eval(input()))-1 for i in range(Q)]

que=deque(ls)

co=[0 for i in range(N)]

for j in range(Q):

  co[que.popleft()]+=1

for i in co:

  if i>Q-K:

    print("Yes")

  else:

    print("No")
N, K, Q = list(map(int, input().split()))
a = [int(eval(input())) for i in range(Q)]
point = [0 for i in range(N)]
for i in range(Q):
    point[a[i] - 1] = point[a[i] - 1] + 1
for j in range(N):
    if point[j] >= Q - K + 1:
        print("Yes")
    else:
        print("No")

from collections import deque

N, K, Q = list(map(int, input().split()))
ls = [int(eval(input())) - 1 for i in range(Q)]
que = deque(ls)
co = [0 for i in range(N)]
for j in range(Q):
    co[que.popleft()] += 1
for i in co:
    if i > Q - K:
        print("Yes")
    else:
        print("No")

+from collections import deque + -a = [int(eval(input())) for i in range(Q)] -point = [0 for i in range(N)] -for i in range(Q): -    point[a[i] - 1] = point[a[i] - 1] + 1 -for j in range(N): -    if point[j] >= Q - K + 1: +ls = [int(eval(input())) - 1 for i in range(Q)] +que = deque(ls) +co = [0 for i in range(N)] +for j in range(Q): +    co[que.popleft()] += 1 +for i in co: +    if i > Q - K: