import collections

N, K, Q = map(int, input().split())
A = [int(input()) - 1 for i in range(Q)]
A_count = collections.Counter(A)
A_sum = sum(A_count.values())
for i in range(N):
    if K - (A_sum - A_count[i]) <= 0:
        print('No')
    else:
        print('Yes') import collections collections N, K, Q = map(int, input().split()) N map(int, input().split()) map int input().split() ().split () input split K Q int(input()) - 1 for i in range(Q) for i in range(Q) i range(Q) range Q for i in range(Q) int(input()) - 1 int(input()) int input() input 1 A = [int(input()) - 1 for i in range(Q)] A [int(input()) - 1 for i in range(Q)] A_count = collections.Counter(A) A_count collections.Counter(A) collections.Counter collections Counter A A_sum = sum(A_count.values()) A_sum sum(A_count.values()) sum A_count.values() A_count.values A_count values for i in range(N):
    if K - (A_sum - A_count[i]) <= 0:
        print('No')
    else:
        print('Yes') i range(N) range N if K - (A_sum - A_count[i]) <= 0:
        print('No')
    else:
        print('Yes') K - (A_sum - A_count[i]) <= 0 K - (A_sum - A_count[i]) K A_sum - A_count[i] A_sum A_count[i] A_count i 0 print('No') print 'No' print('Yes') print 'Yes' N, K, Q = map(int, input().split()) map(int, input().split()) N Q = map(int, input().split()) map(int, input().split()) Q A_sum = sum(A_count.values()) sum(A_count.values()) A_sum A = [int(input()) - 1 for i in range(Q)] [int(input()) - 1 for i in range(Q)] A A_count = collections.Counter(A) collections.Counter(A) A_count K, Q = map(int, input().split()) map(int, input().split()) K
import collections

N, K, Q = map(int, input().split())
A = [int(input()) - 1 for i in range(Q)]
A_count = collections.Counter(A)
A_sum = sum(A_count.values())
for i in range(N):
    if K - (A_sum - A_count[i]) <= 0:
        print('No')
    else:
        print('Yes')
