n, k, q = list(map(int, input().split()))

collect = [0] * (n+1)
for i in range(q):
    p = int(input())
    collect[p] += 1

for j in range(1, n+1):
    if k - (q - collect[j]) > 0:
        print("Yes")
    else:
        print("No")  n, k, q = list(map(int, input().split())) n list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split k q collect = [0] * (n+1) collect [0] * (n+1) [0] 0 n+1 n 1 for i in range(q):
    p = int(input())
    collect[p] += 1 i range(q) range q p = int(input()) p int(input()) int input() input collect[p] += 1 collect[p] collect p 1 for j in range(1, n+1):
    if k - (q - collect[j]) > 0:
        print("Yes")
    else:
        print("No")  j range(1, n+1) range 1 n+1 n 1 if k - (q - collect[j]) > 0:
        print("Yes")
    else:
        print("No")  k - (q - collect[j]) > 0 k - (q - collect[j]) k q - collect[j] q collect[j] collect j 0 print("Yes") print "Yes" print("No") print "No" collect = [0] * (n+1) [0] * (n+1) collect k, q = list(map(int, input().split())) list(map(int, input().split())) k p = int(input()) int(input()) p n, k, q = list(map(int, input().split())) list(map(int, input().split())) n q = list(map(int, input().split())) list(map(int, input().split())) q
n, k, q = list(map(int, input().split()))

collect = [0] * (n+1)
for i in range(q):
    p = int(input())
    collect[p] += 1

for j in range(1, n+1):
    if k - (q - collect[j]) > 0:
        print("Yes")
    else:
        print("No") 