import bisect as bi



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

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

B = [K]*N

p = 0

for i in range(N+1):

    A.append(i+1)

C = sorted(A)

for i in range(N):

    B[i] += bi.bisect_left(C,i+2) - p - 1

    p = bi.bisect_left(C,i+2)

for i in range(N):

    if(B[i] > Q):

        print("Yes")

    else:

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

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

B = [K]*N

p = 0

for i in range(Q):

    B[A[i]-1] += 1

for i in range(N):

    if(B[i] > Q):

        print("Yes")

    else:

        print("No")
import bisect as bi

N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for i in range(Q)]
B = [K] * N
p = 0
for i in range(N + 1):
    A.append(i + 1)
C = sorted(A)
for i in range(N):
    B[i] += bi.bisect_left(C, i + 2) - p - 1
    p = bi.bisect_left(C, i + 2)
for i in range(N):
    if B[i] > Q:
        print("Yes")
    else:
        print("No")

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

-import bisect as bi - -for i in range(N + 1): -    A.append(i + 1) -C = sorted(A) -for i in range(N): -    B[i] += bi.bisect_left(C, i + 2) - p - 1 -    p = bi.bisect_left(C, i + 2) +for i in range(Q): +    B[A[i] - 1] += 1