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

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



points = [K - Q] * N



for i in A:

    points[i - 1] += 1

for p in points:

    if p > 0:

        print("Yes")

    else:

        print("No")
def INT():

    return int(eval(input()))



def MI():

    return list(map(int, input().split()))



def LI():

    return list(map(int, input().split()))



N, K, Q = MI()

A = [K - Q] * N



for i in range(Q):

    A_i = INT()

    A[A_i - 1] += 1

    

for a in A:

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

def INT():
    return int(eval(input()))


def MI():
    return list(map(int, input().split()))


def LI():
    return list(map(int, input().split()))


N, K, Q = MI()
A = [K - Q] * N
for i in range(Q):
    A_i = INT()
    A[A_i - 1] += 1
for a in A:
    print(("Yes" if a > 0 else "No"))

-N, K, Q = list(map(int, input().split())) -A = [int(eval(input())) for _ in range(Q)] -points = [K - Q] * N -for i in A: -    points[i - 1] += 1 -for p in points: -    if p > 0: -        print("Yes") -    else: -        print("No") +def INT(): +    return int(eval(input())) + + +def MI(): +    return list(map(int, input().split())) + + +def LI(): +    return list(map(int, input().split())) + + +N, K, Q = MI() +A = [K - Q] * N +for i in range(Q): +    A_i = INT() +    A[A_i - 1] += 1 +for a in A: +    print(("Yes" if a > 0 else "No"))